Reverse Turing test if the subject is or is not human. As of 2004, such procedures, called CAPTCHAs, are used in some anti-spam systems to prevent automated bulk use of communications systems. The use of captchas is controversial. Circumvention methods exist that reduce their effectiveness. Also, many implementations of captchas (particularly ones desired to counter circumvention) are inaccessible to humans with disabilities, and/or are difficult for humans to pass. Note that "CAPTCHA" is an acronym for "Completely Automated Public Turing test to tell Computers and Humans Apart" so that the original designers of the test regard the test as a Turing test to
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