Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Tractability and artificial intelligence
Journal of Experimental & Theoretical Artificial Intelligence
Needed: a new test of intelligence
ACM SIGART Bulletin
The quest for the thinking computer
AI Magazine
Journal of the ACM (JACM)
The Turing test is for the birds
ACM SIGART Bulletin
PSPACE is provable by two provers in one round
Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Journal of Logic, Language and Information
Minds and Machines
Hi-index | 0.00 |
Alan Turing proposed an interactive test to replace the question "Can machines think?" This test has become known as the Turing Test and its validity for determining intelligence or thinking is still in question.Struggling with the validity of long proofs, program correctness, computational complexity and cryptography, theoreticians developed interactive proof systems. By formalizing the Turing Test as an interactive proof system and by employing results from complexity theory, this paper investigates the power and limitations of the Turing Test. In particular, assuming the notion of completeness for standard complexity classes carries over faithfully to human cognition, then we can say: if human intelligence subsumes machine intelligence, and human intelligence is not simulatable by any bounded machine, then the Turing Test can distinguish humans and machines to within arbitrarily high probability.This paper makes no claim about the Turing Test's sufficiency to distinguish humans and machines. Rather, through its formalization this paper gives several ramifications involving the acceptance or rejection of the Turing Test as sufficient for making any such distinction.