Reverse Turing test subject of the test involves reversing the roles of the real and control subjects. When a Turing test is applied to a mixed group of human and computer subjects, the computers are the nominal subjects. However, the humans are judged in exactly the same way, and so their Turing test scores can also be calculated. This is another way of viewing the situation described in the previous section. The term "reverse Turing test" has also been applied to a Turing test (test of humanity) that is administered by a computer. In other words, a computer administers a test to determine
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