See Turing jump on Wiktionary
{
"etymology_text": "Named after Alan Turing.",
"forms": [
{
"form": "Turing jumps",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Turing jump (plural Turing jumps)",
"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": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"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"
}
],
"glosses": [
"In computability theory, an operation that assigns to each decision problem X a successively harder decision problem X′ with the property that X′ is not decidable by an oracle machine with an oracle for X."
],
"id": "en-Turing_jump-en-noun-xsyI6i3E",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"computability theory",
"computability theory"
],
[
"operation",
"operation"
],
[
"assign",
"assign"
],
[
"decision problem",
"decision problem"
],
[
"successively",
"successively"
],
[
"hard",
"hard"
],
[
"property",
"property"
],
[
"decidable",
"decidable"
],
[
"oracle machine",
"oracle machine"
],
[
"oracle",
"oracle"
]
],
"raw_glosses": [
"(computing theory) In computability theory, an operation that assigns to each decision problem X a successively harder decision problem X′ with the property that X′ is not decidable by an oracle machine with an oracle for X."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Alan Turing"
]
}
],
"word": "Turing jump"
}
{
"etymology_text": "Named after Alan Turing.",
"forms": [
{
"form": "Turing jumps",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Turing jump (plural Turing jumps)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"In computability theory, an operation that assigns to each decision problem X a successively harder decision problem X′ with the property that X′ is not decidable by an oracle machine with an oracle for X."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"computability theory",
"computability theory"
],
[
"operation",
"operation"
],
[
"assign",
"assign"
],
[
"decision problem",
"decision problem"
],
[
"successively",
"successively"
],
[
"hard",
"hard"
],
[
"property",
"property"
],
[
"decidable",
"decidable"
],
[
"oracle machine",
"oracle machine"
],
[
"oracle",
"oracle"
]
],
"raw_glosses": [
"(computing theory) In computability theory, an operation that assigns to each decision problem X a successively harder decision problem X′ with the property that X′ is not decidable by an oracle machine with an oracle for X."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Alan Turing"
]
}
],
"word": "Turing jump"
}
Download raw JSONL data for Turing jump meaning in All languages combined (1.5kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-25 from the enwiktionary dump dated 2025-01-20 using wiktextract (c15a5ce and 5c11237). 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.