e/Universal Turing machine

Information
has gloss	eng: In computer science, a universal Turing machine is a Turing machine that can simulate an arbitrary Turing machine on arbitrary input. The universal machine essentially achieves this by reading both the description of machine to be simulated as well as the input thereof from its own tape. Alan Turing introduced this machine in 1936–1937. This model is considered by some (for example, Martin Davis (2000)) to be the origin of the stored program computer—used by John von Neumann (1946) for the "Electronic Computing Instrument" that now bears von Neumann's name: the von Neumann architecture. It is also known as universal computing machine, universal machine, machine U, U.
lexicalization	eng: universal Turing machine
instance of	e/Computational model

Meaning
Croatian
has gloss	hrv: Ovaj se stroj kao model računanja sad zove univerzalni Turingov stroj.
lexicalization	hrv: Univerzalni Turingov stroj
Italian
has gloss	ita: In teoria della computazione si dice macchina di Turing universale (termine che abbreviamo con MdTu) una macchina di Turing capace di simulare le evoluzioni di ogni macchina di Turing. Tale macchina è stata proposta da Turing nel suo fondamentale lavoro del 1936 e gli ha consentito di dare una risposta negativa al problema della decidibilità, il cosiddetto "Entscheidungsproblem", posto da David Hilbert nel 1928.
lexicalization	ita: macchina di Turing universale
Portuguese
lexicalization	por: máquina de Turing universal
Russian
has gloss	rus: Универсальной машиной Тью́ринга называют машину Тьюринга, которая может заменить собой любую машину Тьюринга. Получив на вход программу и входные данные, она вычисляет ответ, который вычислила бы по входным данным машина Тьюринга, чья программа была дана на вход.
lexicalization	rus: Универсальная машина Тьюринга
Chinese
lexicalization	zho: 通用圖靈機

Media
media:img	Turing Machine.png
media:img	Universal Turing machine.svg