David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
Minds and Machines 20 (2):203-212 (2010)
This paper revisits the often debated question Can machines think? It is argued that the usual identification of machines with the notion of algorithm has been both counter-intuitive and counter-productive. This is based on the fact that the notion of algorithm just requires an algorithm to contain a finite but arbitrary number of rules. It is argued that intuitively people tend to think of an algorithm to have a rather limited number of rules. The paper will further propose a modification of the above mentioned explication of the notion of machines by quantifying the length of an algorithm. Based on that it appears possible to reconcile the opposing views on the topic, which people have been arguing about for more than half a century.
|Keywords||AI debate Algorithmic Kolmogorov complexity Turing Test|
|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
Roger Penrose (1989). The Emperor's New Mind. Oxford University Press.
Alan M. Turing (1950). Computing Machinery and Intelligence. Mind 59 (October):433-60.
John R. Lucas (1961). Minds, Machines and Godel. Philosophy 36 (April-July):112-127.
B. Jack Copeland (2002). Hypercomputation. Minds and Machines 12 (4):461-502.
Alan Turing (1936). On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42 (1):230-265.
Citations of this work BETA
J. Ignacio Serrano, M. Dolores del Castillo & Manuel Carretero (2014). Cognitive? Science? Foundations of Science 19 (2):115-131.
Similar books and articles
Oron Shagrir (1997). Two Dogmas of Computationalism. Minds and Machines 7 (3):321-44.
Xavier Guchet (2007). Nanomachine. Techne 11 (1):71-89.
Eli Dresner (2008). Turing-, Human- and Physical Computability: An Unasked Question. [REVIEW] Minds and Machines 18 (3):349-355.
Dan Klein & Christopher D. Manning, An Ç ´Ò¿ Μ Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars.
Kuo-Chin Chang, Tzung-Pei Hong & Shian-Shyong Tseng (1996). Machine Learning by Imitating Human Learning. Minds and Machines 6 (2):203-228.
Paola Cantu' & Italo Testa (2011). Algorithms and Arguments: The Foundational Role of the ATAI-Question. In Frans H. van Eemeren, Bart Garssen, David Godden & Gordon Mitchell (eds.), Proceedings of the Seventh International Conference of the International Society for the Study of Argumentation (pp. 192-203). Rozenberg / Sic Sat
David A. Nelson (1992). Deductive Program Verification (a Practitioner's Commentary). Minds and Machines 2 (3):283-307.
Eric Steinhart (2002). Logically Possible Machines. Minds and Machines 12 (2):259-280.
Added to index2010-06-19
Total downloads50 ( #83,980 of 1,796,259 )
Recent downloads (6 months)5 ( #169,168 of 1,796,259 )
How can I increase my downloads?