Turing machines, computers and artificial intelligence


Abstract
This work investigates some of the issues and consequences for the field of artificial intelligence and cognitive science, which are related to the perceived limits of computation with current digital equipment. The Church -Turing thesis and the specific properties of Turing machines are examined and some of the philosophical 'in principle' objections, such as the application of Gödel's incompleteness theorem, are discussed. It is argued that the misinterpretation of the Church-Turing thesis has led to unfounded assumptions about the limitations of computing machines in general. Modern digital computers, which are based on the von Neuman architecture, can typically be programmed so that they interact effectively with the real word. It is argued that digital computing machines are supersets of Turing machines, if they are, for example, programmed to interact with the real world. Moreover, computing is not restricted to the domain of discrete state machines. Analog computers and real or simulated neural nets exhibit properties that may not be accommodated in a definition of computing, which is based on Turing machines. Consequently, some of the philosophical 'in principle' objections to artificial intelligence may not apply in reference to engineering efforts in artificial intelligence
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 39,566
External links

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.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Alan Turing and the Mathematical Objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
What Turing Did After He Invented the Universal Turing Machine.B. Jack Copeland & Diane Proudfoot - 2000 - Journal of Logic, Language and Information 9 (4):491-509.
Who's Afraid of the Turing Test?Dale Jacquette - 1993 - Behavior and Philosophy 20 (21):63-74.
The Broad Conception of Computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
Notes on the Turing Test.C. Crawford - 1994 - Communications of the Association for Computing Machinery 37 (June):13-15.
Turing's Two Tests for Intelligence.Susan G. Sterrett - 1999 - Minds and Machines 10 (4):541-559.
Turing’s Responses to Two Objections.Darren Abramson - 2008 - Minds and Machines 18 (2):147-167.
Neural and Super-Turing Computing.Hava T. Siegelmann - 2003 - Minds and Machines 13 (1):103-114.

Analytics

Added to PP index
2013-11-08

Total views
5 ( #920,448 of 2,325,859 )

Recent downloads (6 months)
1 ( #922,770 of 2,325,859 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature