The ideals of a programming language may describe a Turing machine equivalent, but there is no implementation yet which is. Nor will there ever be - the Turing machine has (potentially) infinite memory.

The definition of P-class problems and NP-class problems are the primary use for the idea of Turing machine equivalents.

Sign up

Need help? accounthelp@everything2.com