A Formalization of the Turing Test

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Formalization of the Turing Test does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Formalization of the Turing Test, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Formalization of the Turing Test will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-191931

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.