Machines were introduced as calculating devices to simulate operations carried out by human computors following fixed algorithms: this is true for the early mechanical calculators devised by Pascal and Leibniz, for the analytical engine built by Babbage, and the theoretical machines introduced by Turing. The distinguishing feature of the latter is their universality: They are claimed to be able to capture any algorithm whatsoever and, conversely, any procedure they can carry out is evidently algorithmic. The study of such "paper machines" by mathematical means is the topic of our contribution. This is not only in accord with its usual understanding in computer science, but conceptually and historically right, when we recall the purpose for which Turing machines were introduced.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Observability of Turing Machines: A Refinement of the Theory of Computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
The Church-Turing Thesis and Effective Mundane Procedures.Leon Horsten - 1995 - Minds and Machines 5 (1):1-8.
Infinite Time Turing Machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Turing's o-Machines, Searle, Penrose, and the Brain.Jack Copeland - 1998 - Analysis 58 (2):128-138.
K-Graph Machines: Generalizing Turing's Machines and Arguments.Wilfried Sieg & John Byrnes - unknown
The Broad Conception of Computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
Computing Machines Can't Be Intelligent (...And Turing Said So).Peter Kugel - 2002 - Minds and Machines 12 (4):563-579.
Added to index2010-12-22
Total downloads23 ( #221,125 of 2,177,974 )
Recent downloads (6 months)1 ( #317,205 of 2,177,974 )
How can I increase my downloads?