| King's/PP/AMT/B contains: |
| <-- See earlier |
| 3 |
'A practical form of type theory I.' |
| 4 |
'Intelligent machinery, a heretical theory' |
| 5 |
'Can digital computers think?' |
| 6 |
'Can automatic calculating machines be said to think?' |
| 7 |
'Digital computers applied to games' |
| 8 |
'Checking a large routine' |
| 9 |
'Computing machinery and intelligence' |
| 10 |
'Equivalence of left and right almost periodicity' |
| 11 |
'Computability and lambda-Definability' |
| 12 |
'On computable numbers, with an application to the Entscheidungsproblem' |
| 13 |
'Finite approximations to lie groups' |
| See later --> |
|
The Papers of Alan Mathison Turing
| Title |
'Checking a large routine' |
| Reference |
AMT/B/8 |
| Creator |
Turing, Alan Mathison |
| Covering Dates |
1949–1984 |
| Extent and Medium |
6 items in envelope; paper |
|
| Content and context |
|
The file comprises a photocopy of a paper given by AMT on 24 June 1949 at the inaugural conference of the EDSAC computer at the Mathematical Laboratory, Cambridge, and an off-print of the version published in under the title 'An early program proof by Alan Turing'.
The off-print was received in 1984 from C. B. Jones.
|
| Further information |
The paper was published in the 'Report of a Conference on High Speed Automatic Calculating Machines', pp.67-9. The paper as published contained several transcription errors, and a corrected version, with comments, was published by F. L. Morris and C. B. Jones in 'Annals of the History of Computing' Vol. 6, Apr. 1984. |
| No further on-line information. |
|