universal Turing machine
Universal Turing machine is a turing machine that can simulate an arbitrary Turing machine on arbitrary input by reading both the description of the machine to be simulated as well as the input thereof from its own tape.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2541005246
- Described as
- turing machine that can simulate an arbitrary Turing machine on arbitrary input by reading both the description of the machine to be simulated as well as the input thereof from its own tape
- Other names
- Universal Computing Machine, UTM, UCM
- What it is
- mathematical concept
- Wikipedias with a page
- 18
Wikidata item Q2703890 (wikidata.org/wiki/Q2703890), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1377070305
In computer science, a universal Turing machine (UTM) is a Turing machine capable of computing any computable sequence, as described by Alan Turing in his seminal paper "On Computable Numbers, with an Application to the Entscheidungsproblem". Or, in other words, a Turing machine that is capable of simulating any other specialized Turing machines.
Common sense might say that a universal machine is impossible, but Turing proves that it is possible. He suggested that we may compare a human in the process of computing a real number to a machine that is only capable of a finite number of conditions q1,q2,…,qR; which will be called "m-configurations". He then described the operation of such machine, as described below, and argued:It is my contention that these operations include all those which are used in the computation of a number.
Turing introduced the idea of such a machine in 1936–1937.
From the Wikipedia article “Universal Turing machine” (en.wikipedia.org/wiki/Universal_Turing_machine), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
