Philosophia Mathematica 3 (1):5-30 (1995)
|Abstract||Machines were introduced as calculating devices to simulate operations carried out by human computers following fixed algorithms. The mathematical study of (paper) machines is the topic of our essay. The first three sections provide necessary logical background, examine the analyses of effective calculability given in the thirties, and describe results that are central to recursion theory, reinforcing the conceptual analyses. In the final section we pursue our investigation in a quite different way and focus on principles that govern the operations of physically realizable machines.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Achim Hoffmann (forthcoming). Can Machines Think? An Old Question Reformulated. Minds and Machines.
Peter Kugel (2002). Computing Machines Can't Be Intelligent (...And Turing Said So). Minds and Machines 12 (4):563-579.
Joel David Hamkins (2002). Infinite Time Turing Machines. Minds and Machines 12 (4):567-604.
Luis Monta�O. Hirose (1995). Organisational Spaces and Intelligent Machines: A Metaphorical Approach to Ethics. AI and Society 9 (1):43-56.
Michael Freund & Daniel Lehmann (1994). Nonmonotonic Reasoning: From Finitary Relations to Infinitary Inference Operations. Studia Logica 53 (2):161 - 201.
Eric Steinhart (2002). Logically Possible Machines. Minds and Machines 12 (2):259-280.
B. Jack Copeland (2002). Accelerating Turing Machines. Minds and Machines 12 (2):281-300.
Yaroslav Sergeyev & Alfredo Garro (2010). Observability of Turing Machines: A Refinement of the Theory of Computation. Informatica 21 (3):425–454.
Carol E. Cleland (2002). On Effective Procedures. Minds and Machines 12 (2):159-179.
Added to index2009-01-28
Total downloads6 ( #147,143 of 556,895 )
Recent downloads (6 months)1 ( #64,931 of 556,895 )
How can I increase my downloads?