Reverse Turing test a computer is then said to "pass the Turing test" if it is also judged human. Any of these roles may be changed to form a "reverse Turing test". Arguably the standard form of the reverse Turing test is one in which the subjects attempt to appear to be a computer rather than a human. A formal reverse Turing test follows the same format as a Turing test. Human subjects attempt to imitate the conversational style of a conversation program such as ELIZA. Doing this well involves deliberately ignoring, to some degree, the meaning of the conversation that is immediately
Turing degree Turing degree In computer science and mathematical logic the Turing degree (named after Alan Turing) or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set. The concept of Turing degree is fundamental in computability theory, where sets of natural numbers are often regarded as decision problems. The Turing degree of a set is a measure of how difficult it is to solve the decision problem associated with the set, that is, to determine whether an arbitrary number is in the given set. Two sets are Turing equivalent if they have the