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
Facts
2 properties- Instance of
- mathematical concept
- Subclass of
- Turing machine[2]
🏷️ Also known as
en UCM
en UTM
en universal Turing machine
en Universal Computing Machine
ar آلة تورينج العالمية
de universelle Turingmaschine
de UTM
el Καθολική Μηχανή Τούρινγκ
es Máquina universal de Turing
es máquina de Turing universal
es Maquina de Turing universal
es Maquina universal de Turing
fa تورینگ
fr machine de Turing universelle
he מכונת טיורינג אוניברסלית
it macchina di Turing universale
ja 万能チューリングマシン
ja 万能チューリング機械
nl universele Turing-machine
pt Máquina turing universal
🔖 Identifiers · 9
- GND ID
- 4203523-5
- OpenAlex ID
- C131671149
- Dictionary of Algorithms and Data Structures ID
- universalTur
- Freebase ID
- /m/0jdlh
- MathWorld ID
- UniversalTuringMachine
- Microsoft Academic ID (discontinued)
- 131671149
- PlanetMath ID
- UniversalTuringMachine
- Quora topic ID
- Universal-Turing-Machine
- Treccani's Enciclopedia della Matematica ID
- macchina-universale-di-turing
🔗 Connections
Created notable works 1
Maintained by WikiProject 1
Subclass of 1
← Has part(s) of the class 1
Press Enter · cited answer in seconds
0 sources
Summary
universal Turing machine is a mathematical concept[1].