Adjective
Turing complete (not comparable)
(computing theory) Equivalent in power to a universal Turing machine; equivalently, functionally complete.
Turing-complete (not comparable)
Alternative spelling of Turing complete.
Turing-complete
Adding unbounded loops (WHILE, GOTO) makes the language partially recursive, or Turing-complete; Floop is such, as are almost all real-world computer languages. Source: Internet
Although (untyped) lambda calculus is Turing-complete, simply typed lambda calculus is not. Source: Internet
Despite the language's intentionally obtuse and wordy syntax, INTERCAL is nevertheless Turing-complete : given enough memory, INTERCAL can solve any problem that a Universal Turing machine can solve. Source: Internet
Computability theory The first result of computability theory is that it is impossible in general to predict what a Turing-complete program will do over an arbitrarily long time. Source: Internet
Charles Babbage 's analytical engine (1830s) would have been the first Turing-complete machine if it had been built at the time it was designed. Source: Internet
Esoteric programming terms Turing tarpit main A Turing tarpit is a Turing-complete programming language in which any computable function could theoretically be written, but in which it is impractically difficult to do so. Source: Internet