General Science and Philosophy

   

Computing Machinery, Intelligence and Undecidability

Authors: P. Castro

In 1950 Alan Turing proposed a decision criteria for intelligence validation in a computer. Most simply if a human judge was incapable of deciding from two witnesses which was the computer and which was the human, the machine would have acquired artificial intelligence. In this paper I will argue that the Turing test has a fundamental problem, making it impossible to provide human intelligence validation. Furthermore I will reason that all empirical tests destined to identify intelligence behavior cannot provide an answer and that consequently artificial intelligence identification is an undecidable problem. Since this must mean that there is no algorithmic procedure tolist humanely intelligent systems, it must also mean that human intelligence is not computable and therefore that there is no pragmatic theory one can write to build an humanely intelligent robot.

Comments: 6 Pages.

Download: PDF

Submission history

[v1] 2016-08-04 05:56:56

Unique-IP document downloads: 13 times

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus