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 is that there exist problems for which it is impossible to predict what a (Turing-complete) system will do over an arbitrarily long time. The classic example is the halting problem: create an algorithm which takes as input (a) a program in some Turing-complete language, and (b) some data to be fed to "that" program; and which determines whether the program, operating on the input, will eventually stop or will continue forever. It is trivial to create an algorithm that can do this for "some" inputs, but impossible to do this in general. For any characteristic of the program's eventual output,