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 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