Turing complete

English

Alternative forms

Adjective

Turing complete (not comparable)

  1. (computing theory) Equivalent in power to a universal Turing machine; equivalently, functionally complete.
    • 2005, Ben Klemens, Math You Can't Use: Patents, Copyright, and Software, Brookings Institution Press, →ISBN, page 35:
      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.

See also
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.