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 machine for which the action table has at most one entry for each combination of symbol and state. Read-only, right-moving Turing machines are equivalent to NDFAs (as well as DFAs by conversion using the NDFA to DFA conversion algorithm). For practical and didactical intentions the equivalent register machine can be used as a usual assembly programming language. An interesting question is whether the computation model represented by concrete programming languages is Turing equivalent. While the computation of a real computer is based on finite states and thus not capable to simulate a Turing machine, programming languages themselves do not necessarily have