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)
DOI 10.1007/s11023-010-9193-z
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,160
Through your library

References found in this work BETA

The Emperor’s New Mind.Roger Penrose - 1989 - Oxford University Press.
Computing Machinery and Intelligence.Alan M. Turing - 1950 - Mind 59 (October):433-60.
On Computable Numbers, with an Application to the N Tscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.

View all 23 references / Add more references

Citations of this work BETA

Cognitive? Science?J. Ignacio Serrano, M. Dolores del Castillo & Manuel Carretero - 2014 - Foundations of Science 19 (2):115-131.

Add more citations

Similar books and articles


Added to PP index

Total views
163 ( #70,921 of 2,499,411 )

Recent downloads (6 months)
3 ( #209,699 of 2,499,411 )

How can I increase my downloads?


My notes