Turing complete

adj

Turing complete

adj

1

Computing, Computing theory, Engineering, Mathematics, Natural sciences, Physical sciences, Sciences Equivalent in power to a universal Turing machine; equivalently, functionally complete.

All languages that are equivalent to Turing's specification are said to be Turing complete. Turing completeness is a surprisingly low bar. Many hand calculators can understand a Turing complete language. PDF (Portable Document Format), in which many documents on the Internet are available, is itself a Turing complete language.2005, Ben Klemens, Math You Can't Use: Patents, Copyright, and Software, Brookings Institution Press, →ISBN, page 35:

Related terms: Turing machine, universal Turing machine, functionally complete, recursive function

Entry derived from the Wiktionary, under licence CC BY-SA 4.0 — list of authors.