universal Turing machine

views updated

universal Turing machine A Turing machine M that, given any input x and a suitable encoding of any Turing machine K, outputs the result of applying the Turing machine K to the input x. A universal Turing machine therefore can perform all the computations for the class of Turing machines. The existence of such a machine was discovered by A. Turing in 1936. It lead to the concept of the stored-program computer.

More From encyclopedia.com

About this article

universal Turing machine

Updated About encyclopedia.com content Print Article

You Might Also Like

    NEARBY TERMS

    universal Turing machine