Reverse Turing test apparent to a human, and the simulation of the kinds of errors that conversational programs typically make. Arguably unlike the conventional Turing test, this is most interesting when the judges are very familiar with the art of conversation programs, meaning that in the regular Turing test they can very rapidly tell the difference between a computer program and a human acting normally. The humans that perform best (some would say worst) in the reverse Turing test are those that know computers best, and so know the types of errors that computers can be expected to make in conversation. There is
Turing completeness an algorithm can be computed by a Turing machine, and therefore that if any real-world computer can simulate a Turing machine, it is Turing equivalent to a Turing machine. A universal Turing machine can be used to simulate any Turing machine and by extension the computational aspects of any possible real-world computer. To show that something is Turing complete, it is enough to show that it can be used to simulate some Turing complete system. For example, an imperative language is Turing complete if it has conditional branching ("e.g.", "if" and "goto" statements, or a "branch if zero" instruction; see