Transcendental Problem in Turing’s Test
نویسنده
چکیده
This paper introduces the notion of a transcendental problem motivated by the needs to engineer the system which can evolve as the situation changes. The problem is generally called transcendental if it addresses the solution adequacy of the system that is implemented without any provision for subsequent requirement changes. Subsequently, the transcendental problem evident in Turing’s test is analyzed.
منابع مشابه
Turing Test Considered Harmful (IJCAI -1995 invited talk)
Passing the Turing Test is not a sensible goal for Artificial Intelligence. Adherence to Turing’s vision from 1950 is now actively harmful to our field. We review problems with Turing’s idea, and suggest that, ironically, the very cognitive science that he tried to create must reject his research goal.
متن کاملTuring’s Influence on Programming — Book extract from “The Dawn of Software Engineering: from Turing to Dijkstra”
Turing’s involvement with computer building was popularized in the 1970s and later. Most notable are the books by Brian Randell (1973), Andrew Hodges (1983), and Martin Davis (2000). A central question is whether John von Neumann was influenced by Turing’s 1936 paper when he helped build the EDVAC machine, even though he never cited Turing’s work. This question remains unsettled up till this da...
متن کاملThe myth of the Turing machine: the failings of functionalism and related theses
The properties of Turing’s famous `universal machine’ has long sustained functionalist intuitions about the nature of cognition. This paper shows that there is a logical problem with standard functionalist arguments for multiple realizability. These arguments rely essentially on Turing’s powerful insights regarding computation. In addressing a possible reply to this criticism, it is further arg...
متن کاملThe Incomputable Alan Turing
The last century saw dramatic challenges to the Laplacian predictability which had underpinned scientific research for around 300 years. Basic to this was Alan Turing’s 1936 discovery (along with Alonzo Church) of the existence of unsolvable problems. This paper focuses on incomputability as a powerful theme in Turing’s work and personal life, and examines its role in his evolving concept of ma...
متن کاملUnorganised Machines in Learning Classifier Systems
Many representations have been presented to enable the effective evolution of computer programs. Turing was perhaps the first to present a general scheme by which to achieve this end. Significantly, Turing proposed a form of discrete dynamical system and yet dynamical representations remain almost unexplored within genetic programming. This paper presents results from an initial investigation i...
متن کامل