Turing machine equivalent

(idea) by morgandorf Sat Aug 12 2000 at 0:29:30

A machine (physical or virtual) is said to be Turing machine equivalent if it can perform the same tasks as a Turing machine. By their very definition, all programming languages are Turing machine equivalent.

del.icio.us Furl Facebook Digg StumbleUpon Reddit   (I like it!)
(idea) by hobyrne Sat Jun 23 2001 at 1:05:58

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.

del.icio.us Furl Facebook Digg StumbleUpon Reddit   (I like it!)
Y'know, if you log in, you can write something here, or contact authors directly on the site. Create a New User if you don't already have an account.