Universal Turing machine
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
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.
Nº Q2703890 ★★
Uncommon · Knowledge
Universal Turing machine
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
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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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 q 1 , q 2 , … , q R {\displaystyle q_{1},q_{2},\dots ,q_{R}} ; 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.
Text: Wikipédia, CC BY-SA 4.0. · Image: Fschwarzentruber (CC BY-SA 4.0) ·
Related cards
Turing completeness
Ability of a computing system to simulate Turing machines
Nº Q197970 ★★★
Turing machine
Abstract computation model; mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules
Nº Q163310 ★★★★
Turing test
Test of a machine's ability to exhibit intelligent behaviour equivalent to, or indistinguishable from, that of a human
Nº Q189223 ★★★★
Halting problem
Problem of determining whether a given program will finish running or continue forever
Nº Q622849 ★★★
Church–Turing thesis
Thesis about the nature of computable functions
Nº Q309157 ★★
NP (complexity)
Computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time
Nº Q628036 ★★★