A Formalization of the Turing Test
Artificial Intelligence
2010-05-28 v1
Abstract
The paper offers a mathematical formalization of the Turing test. This formalization makes it possible to establish the conditions under which some Turing machine will pass the Turing test and the conditions under which every Turing machine (or every Turing machine of the special class) will fail the Turing test.
Cite
@article{arxiv.1005.4989,
title = {A Formalization of the Turing Test},
author = {Evgeny Chutchev},
journal= {arXiv preprint arXiv:1005.4989},
year = {2010}
}
Comments
10 pages