What does Turing machine mean?
Definitions for Turing machine
ˈtʊər ɪŋ, ˈtyʊər-tur·ing ma·chine
This dictionary definitions page includes all the possible meanings, example usage and translations of the word Turing machine.
Princeton's WordNet
Turing machinenoun
a hypothetical computer with an infinitely long memory tape
Wiktionary
Turing machinenoun
An abstract computing machine introduced in 1936 by Alan Turing to give a mathematically precise definition of computability.
Etymology: From Alan Turing English mathematician, logician, and cryptographer
Wikipedia
Turing machine
A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any computer algorithm.The machine operates on an infinite memory tape divided into discrete cells, each of which can hold a single symbol drawn from a finite set of symbols called the alphabet of the machine. It has a "head" that, at any point in the machine's operation, is positioned over one of these cells, and a "state" selected from a finite set of states. At each step of its operation, the head reads the symbol in its cell. Then, based on the symbol and the machine's own present state, the machine writes a symbol into the same cell, and moves the head one step to the left or the right, or halts the computation. The choice of which replacement symbol to write and which direction to move is based on a finite table that specifies what to do for each combination of the current state and the symbol that is read.
ChatGPT
turing machine
A Turing machine is a theoretical computing device, conceptualized by mathematician Alan Turing in 1936, that manipulates symbols on a strip of tape according to certain predefined rules. The machine operates on an infinite memory tape divided into discrete "cells" and can change its state according to the current state and the current symbol it reads. It is considered a fundamental concept in the theory of computation, capable of solving any computation problem that is solvable. Although not intended as a practical computing technology, it plays a central role in the theoretical understanding of algorithms and computational processes.
Wikidata
Turing machine
A Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer. The "Turing" machine was invented in 1936 by Alan Turing who called it an "a-machine". The Turing machine is not intended as practical computing technology, but rather as a hypothetical device representing a computing machine. Turing machines help computer scientists understand the limits of mechanical computation. Turing gave a succinct definition of the experiment in his 1948 essay, "Intelligent Machinery". Referring to his 1936 publication, Turing wrote that the Turing machine, here called a Logical Computing Machine, consisted of: ...an unlimited memory capacity obtained in the form of an infinite tape marked out into squares, on each of which a symbol could be printed. At any moment there is one symbol in the machine; it is called the scanned symbol. The machine can alter the scanned symbol and its behavior is in part determined by that symbol, but the symbols on the tape elsewhere do not affect the behavior of the machine. However, the tape can be moved back and forth through the machine, this being one of the elementary operations of the machine. Any symbol on the tape may therefore eventually have an innings.
Matched Categories
Numerology
Chaldean Numerology
The numerical value of Turing machine in Chaldean Numerology is: 9
Pythagorean Numerology
The numerical value of Turing machine in Pythagorean Numerology is: 7
Translation
Find a translation for the Turing machine definition in other languages:
Select another language:
- - Select -
- 简体中文 (Chinese - Simplified)
- 繁體中文 (Chinese - Traditional)
- Español (Spanish)
- Esperanto (Esperanto)
- 日本語 (Japanese)
- Português (Portuguese)
- Deutsch (German)
- العربية (Arabic)
- Français (French)
- Русский (Russian)
- ಕನ್ನಡ (Kannada)
- 한국어 (Korean)
- עברית (Hebrew)
- Gaeilge (Irish)
- Українська (Ukrainian)
- اردو (Urdu)
- Magyar (Hungarian)
- मानक हिन्दी (Hindi)
- Indonesia (Indonesian)
- Italiano (Italian)
- தமிழ் (Tamil)
- Türkçe (Turkish)
- తెలుగు (Telugu)
- ภาษาไทย (Thai)
- Tiếng Việt (Vietnamese)
- Čeština (Czech)
- Polski (Polish)
- Bahasa Indonesia (Indonesian)
- Românește (Romanian)
- Nederlands (Dutch)
- Ελληνικά (Greek)
- Latinum (Latin)
- Svenska (Swedish)
- Dansk (Danish)
- Suomi (Finnish)
- فارسی (Persian)
- ייִדיש (Yiddish)
- հայերեն (Armenian)
- Norsk (Norwegian)
- English (English)
Word of the Day
Would you like us to send you a FREE new word definition delivered to your inbox daily?
Citation
Use the citation below to add this definition to your bibliography:
Style:MLAChicagoAPA
"Turing machine." Definitions.net. STANDS4 LLC, 2024. Web. 25 Apr. 2024. <https://www.definitions.net/definition/Turing+machine>.
Discuss these Turing machine definitions with the community:
Report Comment
We're doing our best to make sure our content is useful, accurate and safe.
If by any chance you spot an inappropriate comment while navigating through our website please use this form to let us know, and we'll take care of it shortly.
Attachment
You need to be logged in to favorite.
Log In