See time-loop logic on Wiktionary
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "time-loop logic (uncountable)",
"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": "Computer science",
"orig": "en:Computer science",
"parents": [
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A hypothetical system of computation that exploits the Novikov self-consistency principle to compute answers much faster than possible with the standard model of computational complexity using Turing machines."
],
"id": "en-time-loop_logic-en-noun-6LMXnfTd",
"links": [
[
"computer science",
"computer science"
],
[
"hypothetical",
"hypothetical"
],
[
"system",
"system"
],
[
"computation",
"computation"
],
[
"exploit",
"exploit"
],
[
"Novikov self-consistency principle",
"Novikov self-consistency principle"
],
[
"compute",
"compute"
],
[
"answer",
"answer"
],
[
"possible",
"possible"
],
[
"standard",
"standard"
],
[
"model",
"model"
],
[
"computational",
"computational"
],
[
"complexity",
"complexity"
],
[
"Turing machine",
"Turing machine"
]
],
"raw_glosses": [
"(computer science) A hypothetical system of computation that exploits the Novikov self-consistency principle to compute answers much faster than possible with the standard model of computational complexity using Turing machines."
],
"tags": [
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "time-loop logic"
}
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "time-loop logic (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Computer science"
],
"glosses": [
"A hypothetical system of computation that exploits the Novikov self-consistency principle to compute answers much faster than possible with the standard model of computational complexity using Turing machines."
],
"links": [
[
"computer science",
"computer science"
],
[
"hypothetical",
"hypothetical"
],
[
"system",
"system"
],
[
"computation",
"computation"
],
[
"exploit",
"exploit"
],
[
"Novikov self-consistency principle",
"Novikov self-consistency principle"
],
[
"compute",
"compute"
],
[
"answer",
"answer"
],
[
"possible",
"possible"
],
[
"standard",
"standard"
],
[
"model",
"model"
],
[
"computational",
"computational"
],
[
"complexity",
"complexity"
],
[
"Turing machine",
"Turing machine"
]
],
"raw_glosses": [
"(computer science) A hypothetical system of computation that exploits the Novikov self-consistency principle to compute answers much faster than possible with the standard model of computational complexity using Turing machines."
],
"tags": [
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "time-loop logic"
}
Download raw JSONL data for time-loop logic 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 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.