Universal Turing machine
In computer science, a universal Turing machine (UTM) is a Turing machine that simulates an arbitrary Turing machine on arbitrary input. The universal machine essentially achieves this by reading both the description of the machine to be simulated as well as the input to that machine from its own tape. Alan Turing introduced the idea of such a machine in 1936–1937. This principle is considered to be the origin of the idea of a stored-program computer used by John von Neumann in 1946 for the "Electronic Computing Instrument" that now bears von Neumann's name: the von Neumann architecture.
Wikipage disambiguates
AIXIA New Kind of ScienceAlan_TuringAlgorithm characterizationsAlgorithmic information theoryAlgorithmic probabilityAlgorithmically random sequenceArtificial neural networkAutomatic Computing EngineCellular automatonCellular neural networkChaitin's constantChinese roomChurch–Turing thesisClaude ShannonCodebreaker (film)Colossus computerComputability theoryComputable numberComputerComputer programComputing Machinery and IntelligenceConway's Game of LifeCounter machineData typeDavid DeutschDescription numberDiscrete-symbol computerDistributed computingDonald DaviesEconomic calculation problemEpiphenomenalismGeneral recursive functionGisbert HasenjaegerGlider (Conway's Life)Golly (program)Gottfried_Wilhelm_LeibnizHP-41CHP-42S
Link from a Wikipage to another Wikipage
seeAlso
primaryTopic
Universal Turing machine
In computer science, a universal Turing machine (UTM) is a Turing machine that simulates an arbitrary Turing machine on arbitrary input. The universal machine essentially achieves this by reading both the description of the machine to be simulated as well as the input to that machine from its own tape. Alan Turing introduced the idea of such a machine in 1936–1937. This principle is considered to be the origin of the idea of a stored-program computer used by John von Neumann in 1946 for the "Electronic Computing Instrument" that now bears von Neumann's name: the von Neumann architecture.
has abstract
Em ciência da computação, uma ...... da às máquinas que ela simula.
@pt
En ciencias de la computación, ...... a con las máquinas que simula.
@es
En informatique, plus précisém ...... l'architecture de von Neumann.
@fr
In computer science, a univers ...... to the machines it simulates.
@en
In de wiskunde en de theoretis ...... : de von Neumann-architectuur.
@nl
In teoria della computazione, ...... macchina di Turing universale.
@it
Una màquina universal de Turin ...... nta que la màquina que simula.
@ca
Στην επιστήμη των υπολογιστών, ...... σης αρχιτεκτονική φον Νόιμαν).
@el
Универсальной машиной Тью́ринг ...... я программа была дана на вход.
@ru
Універсальна машина Тюрінга(УМ ...... гідно своїх внутрішніх правил.
@uk
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,024,415,515
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
comment
Em ciência da computação, uma ...... tacional, uma máquina de Turin
@pt
En ciencias de la computación, ...... universal, máquina universal.
@es
En informatique, plus précisém ...... l'architecture de von Neumann.
@fr
In computer science, a univers ...... the von Neumann architecture.
@en
In de wiskunde en de theoretis ...... deze input accepteert wanneer:
@nl
In teoria della computazione, ...... sto da David Hilbert nel 1928.
@it
Una màquina universal de Turin ...... d'arquitectura de von Newmann.
@ca
Στην επιστήμη των υπολογιστών, ...... σης αρχιτεκτονική φον Νόιμαν).
@el
Универсальной машиной Тью́ринг ...... я программа была дана на вход.
@ru
Універсальна машина Тюрінга(УМ ...... но необмежену кількість задач.
@uk
label
Macchina di Turing universale
@it
Machine de Turing universelle
@fr
Màquina universal de Turing
@ca
Máquina de Turing universal
@es
Máquina de Turing universal
@pt
Universal Turing machine
@en
Universele Turing-machine
@nl
Universelle Turingmaschine
@de
Καθολική Μηχανή Τούρινγκ
@el
Универсальная машина Тьюринга
@ru