A survey of control structures in programming languages
ACM SIGPLAN Notices - Special issue on control structures in programming languages
Operating systems architecture
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
Selected R&D requirements in the computer and information sciences
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
| Hi-index | 0.00 |
On what does the fame of Turing rest? That he proved a theorem showing that for a general computing device -later dubbed a “Turing machine”—there existed functions which it could not compute? I doubt it. More likely it is because of the model he invented and employed: his formal mechanism. This model has captured the imagination and mobilized the thoughts of a generation of scientists. It has provided a base for arguments leading to theories. His model has proved so useful that its generated activity has been distributed not only in mathematics, but through several technologies as well. The arguments employed were not always formal and the consequent creations were not all abstract. Indeed a most fruitful consequence of the Turing machine has been with the creation, study, and computation of functions which are computable, i.e., in computer programming.