David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
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)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Daniele Mundici & Wilfried Seig (1995). Paper Machines. Philosophia Mathematica 3 (1):5-30.
B. Jack Copeland (2002). Accelerating Turing Machines. Minds and Machines 12 (2):281-300.
Joel David Hamkins (2002). Infinite Time Turing Machines. Minds and Machines 12 (4):567-604.
Yaroslav Sergeyev & Alfredo Garro (2010). Observability of Turing Machines: A Refinement of the Theory of Computation. Informatica 21 (3):425–454.
Eric Steinhart (2002). Logically Possible Machines. Minds and Machines 12 (2):259-280.
Leon Horsten (1995). The Church-Turing Thesis and Effective Mundane Procedures. Minds and Machines 5 (1):1-8.
Carol E. Cleland (2002). On Effective Procedures. Minds and Machines 12 (2):159-179.
Joel David Hamkins & Andy Lewis (2000). Infinite Time Turing Machines. Journal of Symbolic Logic 65 (2):567-604.
Jack Copeland (1998). Turing's o-Machines, Searle, Penrose, and the Brain. Analysis 58 (2):128-138.
Eric Steinhart (2003). Supermachines and Superminds. Minds and Machines 13 (1):155-186.
Jack Copeland (1997). The Broad Conception of Computation. American Behavioral Scientist 40 (6):690-716.
Peter Kugel (2002). Computing Machines Can't Be Intelligent (...And Turing Said So). Minds and Machines 12 (4):563-579.
Added to index2010-12-22
Total downloads13 ( #194,523 of 1,726,249 )
Recent downloads (6 months)4 ( #183,615 of 1,726,249 )
How can I increase my downloads?