See Turing machine in All languages combined, or Wiktionary
Download JSON data for Turing machine meaning in English (5.9kB)
{
"etymology_templates": [
{
"args": {},
"expansion": ",",
"name": ","
},
{
"args": {
"1": "mathematician, logician, and cryptographer",
"2": "",
"3": "",
"4": "",
"5": ""
},
"expansion": "mathematician, logician, and cryptographer",
"name": "named-after/list"
},
{
"args": {},
"expansion": "|",
"name": "!"
},
{
"args": {
"1": "en",
"2": "Alan Turing"
},
"expansion": "Alan Turing",
"name": "lang"
},
{
"args": {
"1": "en",
"2": "Alan Turing",
"born": "1912",
"died": "1954",
"nat": "English",
"occ": "mathematician, logician, and cryptographer",
"wplink": "="
},
"expansion": "Named after English mathematician, logician, and cryptographer Alan Turing (1912–1954)",
"name": "named-after"
}
],
"etymology_text": "Named after English mathematician, logician, and cryptographer Alan Turing (1912–1954), who introduced the concept in 1936 to give a mathematically precise definition of computability.",
"forms": [
{
"form": "Turing machines",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Turing machine (plural Turing machines)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Mandarin terms with redundant transliterations",
"parents": [
"Terms with redundant transliterations",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"ref": "2017, Arlindo Oliveira, The Digital Mind: How Science Is Redefining Humanity, MIT Press, page 81",
"text": "Another class, P, is a subset of NP, and includes all decision problems that can be solved by a (deterministic) Turing machine in polynomial time.",
"type": "quotation"
}
],
"glosses": [
"An abstract computing machine that has a finite number of possible internal states and operates on an infinite memory tape by first reading a symbol from a cell in the tape, and then, deterministically, based on that symbol and the machine’s state, writing a symbol in that cell, moving to a neighboring cell, and/or changing state."
],
"id": "en-Turing_machine-en-noun-MhnZ4QZP",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"abstract",
"abstract"
],
[
"computing",
"computing"
],
[
"machine",
"machine"
],
[
"finite",
"finite"
],
[
"internal",
"internal"
],
[
"state",
"state"
],
[
"operate",
"operate"
],
[
"infinite",
"infinite"
],
[
"memory",
"memory"
],
[
"tape",
"tape"
],
[
"symbol",
"symbol"
],
[
"cell",
"cell"
],
[
"deterministically",
"deterministically"
],
[
"stat",
"stat"
],
[
"neighboring",
"neighboring"
],
[
"changing",
"change"
]
],
"raw_glosses": [
"(computing theory) An abstract computing machine that has a finite number of possible internal states and operates on an infinite memory tape by first reading a symbol from a cell in the tape, and then, deterministically, based on that symbol and the machine’s state, writing a symbol in that cell, moving to a neighboring cell, and/or changing state."
],
"related": [
{
"word": "deterministic Turing machine"
},
{
"word": "nondeterministic Turing machine"
},
{
"word": "Turing complete"
},
{
"word": "Turing function"
},
{
"word": "Turing tape"
},
{
"word": "Turing test"
},
{
"word": "turmite"
},
{
"word": "universal Turing machine"
},
{
"word": "functionally complete"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"code": "ar",
"lang": "Arabic",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "آلَة تورنج"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "abstract machine",
"word": "圖靈機"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "túlíngjī",
"sense": "abstract machine",
"word": "图灵机"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "abstract machine",
"word": "確定型圖靈機"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "quèdìngxíng túlíngjī",
"sense": "abstract machine",
"word": "确定型图灵机"
},
{
"code": "cs",
"lang": "Czech",
"sense": "abstract machine",
"tags": [
"masculine"
],
"word": "Turingův stroj"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "abstract machine",
"word": "Turingin kone"
},
{
"code": "fr",
"lang": "French",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "machine de Turing"
},
{
"code": "de",
"lang": "German",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "Turingmaschine"
},
{
"code": "he",
"lang": "Hebrew",
"roman": "mechonát tyúring",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "מכונת טיורינג"
},
{
"code": "hu",
"lang": "Hungarian",
"sense": "abstract machine",
"word": "Turing-gép"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "Turing-vél"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "Turing vél"
},
{
"code": "it",
"lang": "Italian",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "macchina di Turing"
},
{
"code": "fa",
"lang": "Persian",
"sense": "abstract machine",
"word": "ماشین تورینگ"
},
{
"code": "pt",
"lang": "Portuguese",
"sense": "abstract machine",
"word": "máquina de Turing"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "mașină Turing"
},
{
"code": "ru",
"lang": "Russian",
"roman": "mašína Tʹjúringa",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "маши́на Тью́ринга"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "abstract machine",
"tags": [
"masculine"
],
"word": "Turingov stroj"
},
{
"code": "es",
"lang": "Spanish",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "máquina de Turing"
},
{
"code": "tr",
"lang": "Turkish",
"sense": "abstract machine",
"word": "Turing makinesi"
}
]
}
],
"word": "Turing machine"
}
{
"etymology_templates": [
{
"args": {},
"expansion": ",",
"name": ","
},
{
"args": {
"1": "mathematician, logician, and cryptographer",
"2": "",
"3": "",
"4": "",
"5": ""
},
"expansion": "mathematician, logician, and cryptographer",
"name": "named-after/list"
},
{
"args": {},
"expansion": "|",
"name": "!"
},
{
"args": {
"1": "en",
"2": "Alan Turing"
},
"expansion": "Alan Turing",
"name": "lang"
},
{
"args": {
"1": "en",
"2": "Alan Turing",
"born": "1912",
"died": "1954",
"nat": "English",
"occ": "mathematician, logician, and cryptographer",
"wplink": "="
},
"expansion": "Named after English mathematician, logician, and cryptographer Alan Turing (1912–1954)",
"name": "named-after"
}
],
"etymology_text": "Named after English mathematician, logician, and cryptographer Alan Turing (1912–1954), who introduced the concept in 1936 to give a mathematically precise definition of computability.",
"forms": [
{
"form": "Turing machines",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Turing machine (plural Turing machines)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "deterministic Turing machine"
},
{
"word": "nondeterministic Turing machine"
},
{
"word": "Turing complete"
},
{
"word": "Turing function"
},
{
"word": "Turing tape"
},
{
"word": "Turing test"
},
{
"word": "turmite"
},
{
"word": "universal Turing machine"
},
{
"word": "functionally complete"
}
],
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with quotations",
"Mandarin terms with redundant transliterations",
"en:Theory of computing"
],
"examples": [
{
"ref": "2017, Arlindo Oliveira, The Digital Mind: How Science Is Redefining Humanity, MIT Press, page 81",
"text": "Another class, P, is a subset of NP, and includes all decision problems that can be solved by a (deterministic) Turing machine in polynomial time.",
"type": "quotation"
}
],
"glosses": [
"An abstract computing machine that has a finite number of possible internal states and operates on an infinite memory tape by first reading a symbol from a cell in the tape, and then, deterministically, based on that symbol and the machine’s state, writing a symbol in that cell, moving to a neighboring cell, and/or changing state."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"abstract",
"abstract"
],
[
"computing",
"computing"
],
[
"machine",
"machine"
],
[
"finite",
"finite"
],
[
"internal",
"internal"
],
[
"state",
"state"
],
[
"operate",
"operate"
],
[
"infinite",
"infinite"
],
[
"memory",
"memory"
],
[
"tape",
"tape"
],
[
"symbol",
"symbol"
],
[
"cell",
"cell"
],
[
"deterministically",
"deterministically"
],
[
"stat",
"stat"
],
[
"neighboring",
"neighboring"
],
[
"changing",
"change"
]
],
"raw_glosses": [
"(computing theory) An abstract computing machine that has a finite number of possible internal states and operates on an infinite memory tape by first reading a symbol from a cell in the tape, and then, deterministically, based on that symbol and the machine’s state, writing a symbol in that cell, moving to a neighboring cell, and/or changing state."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"translations": [
{
"code": "ar",
"lang": "Arabic",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "آلَة تورنج"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "abstract machine",
"word": "圖靈機"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "túlíngjī",
"sense": "abstract machine",
"word": "图灵机"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "abstract machine",
"word": "確定型圖靈機"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "quèdìngxíng túlíngjī",
"sense": "abstract machine",
"word": "确定型图灵机"
},
{
"code": "cs",
"lang": "Czech",
"sense": "abstract machine",
"tags": [
"masculine"
],
"word": "Turingův stroj"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "abstract machine",
"word": "Turingin kone"
},
{
"code": "fr",
"lang": "French",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "machine de Turing"
},
{
"code": "de",
"lang": "German",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "Turingmaschine"
},
{
"code": "he",
"lang": "Hebrew",
"roman": "mechonát tyúring",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "מכונת טיורינג"
},
{
"code": "hu",
"lang": "Hungarian",
"sense": "abstract machine",
"word": "Turing-gép"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "Turing-vél"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "Turing vél"
},
{
"code": "it",
"lang": "Italian",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "macchina di Turing"
},
{
"code": "fa",
"lang": "Persian",
"sense": "abstract machine",
"word": "ماشین تورینگ"
},
{
"code": "pt",
"lang": "Portuguese",
"sense": "abstract machine",
"word": "máquina de Turing"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "mașină Turing"
},
{
"code": "ru",
"lang": "Russian",
"roman": "mašína Tʹjúringa",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "маши́на Тью́ринга"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "abstract machine",
"tags": [
"masculine"
],
"word": "Turingov stroj"
},
{
"code": "es",
"lang": "Spanish",
"sense": "abstract machine",
"tags": [
"feminine"
],
"word": "máquina de Turing"
},
{
"code": "tr",
"lang": "Turkish",
"sense": "abstract machine",
"word": "Turing makinesi"
}
],
"word": "Turing machine"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-06 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.