See totalistic on Wiktionary
Download JSON data for totalistic meaning in All languages combined (4.5kB)
{
"derived": [
{
"_dis1": "0 0 0",
"word": "outer totalistic"
},
{
"_dis1": "0 0 0",
"word": "semitotalistic"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "totalist",
"3": "ic"
},
"expansion": "totalist + -ic",
"name": "suffix"
}
],
"etymology_text": "totalist + -ic",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "totalistic (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"glosses": [
"Of or relating to totalism."
],
"id": "en-totalistic-en-adj-YC47E3YU",
"links": [
[
"totalism",
"totalism"
]
],
"tags": [
"not-comparable"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Cellular automata",
"orig": "en:Cellular automata",
"parents": [
"Mathematics",
"Theory of computing",
"Formal sciences",
"Computer science",
"Sciences",
"Computing",
"All topics",
"Technology",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"ref": "1989 March 21, Mark Kramer, “Fast LIFE (was: Re: summing 9-cell neighborhoods)”, in comp.theory.cell-automata (Usenet)",
"text": "BTW: Of course the rules were parametrised, so any totalistic 2-dimensional 9-neighbourhood CA could be run.",
"type": "quotation"
},
{
"ref": "1993 January 17, Dan Gordon, “Universal Cellular Automata.”, in comp.theory.cell-automata (Usenet)",
"text": "Note that the game of life is not totalistic: the transition function depends on the cell's own state and on the sum of the neighboring states.",
"type": "quotation"
},
{
"ref": "1994 July 3, Serge Winitzki, “Optimizing \"bitblt\" functions using Xor”, in comp.theory.cell-automata (Usenet)",
"text": "The Xor operation drastically cuts down the number of operations when dealing with totalistic CA rules. For example, a function of four variables a, b, c, d, returning 1 iff there are exactly two ones and two zeros among its arguments, is represented by this Karnaugh diagram:",
"type": "quotation"
}
],
"glosses": [
"Having the state of each cell represented by a number, and the value of a cell dependent only on the sum of the values of nearby cells."
],
"id": "en-totalistic-en-adj-YyQH~EFM",
"links": [
[
"cellular automata",
"cellular automata"
],
[
"state",
"state"
],
[
"cell",
"cell"
],
[
"number",
"number"
],
[
"value",
"value"
],
[
"sum",
"sum"
]
],
"raw_glosses": [
"(cellular automata):",
"Having the state of each cell represented by a number, and the value of a cell dependent only on the sum of the values of nearby cells."
],
"tags": [
"not-comparable"
],
"topics": [
"cellular-automata",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Cellular automata",
"orig": "en:Cellular automata",
"parents": [
"Mathematics",
"Theory of computing",
"Formal sciences",
"Computer science",
"Sciences",
"Computing",
"All topics",
"Technology",
"Fundamental"
],
"source": "w"
},
{
"_dis": "1 23 77",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "2 25 72",
"kind": "other",
"name": "English terms suffixed with -ic",
"parents": [],
"source": "w+disamb"
}
],
"examples": [
{
"ref": "1999 September 2, J. Elliott, “ANNOUNCE: WebsideCA Java applet update”, in comp.theory.cell-automata (Usenet)",
"text": "Many good applets run Moore binary totalistic rules such as Conway's Life, but WebsideCA also runs von Neumann rules, rules in the \"Brian's Brain\" family, non-totalistic binary and decay rules, and Cyclic rules.",
"type": "quotation"
},
{
"ref": "2000 August 20, Gerard Vriens, “Discussion: neighbourhoods”, in comp.theory.cell-automata (Usenet)",
"text": "Since Life is totalistic on 8 neighbours, this requires no extra assumptions.",
"type": "quotation"
},
{
"ref": "2001 October 31, Erik Francis, “Four new rules with replicators”, in comp.theory.cell-automata (Usenet)",
"text": "... but the B/S notation is _the_ standard for two-state totalistic rules.",
"type": "quotation"
}
],
"glosses": [
"Outer totalistic."
],
"id": "en-totalistic-en-adj-rDtTjf4u",
"links": [
[
"cellular automata",
"cellular automata"
],
[
"Outer totalistic",
"Outer totalistic"
]
],
"raw_glosses": [
"(cellular automata):",
"Outer totalistic."
],
"tags": [
"not-comparable"
],
"topics": [
"cellular-automata",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"_dis1": "16 15 69",
"code": "mi",
"lang": "Maori",
"sense": "relating to the doctrine of totalitarianism",
"word": "angangarengare"
}
]
}
],
"word": "totalistic"
}
{
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English terms suffixed with -ic",
"English uncomparable adjectives"
],
"derived": [
{
"word": "outer totalistic"
},
{
"word": "semitotalistic"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "totalist",
"3": "ic"
},
"expansion": "totalist + -ic",
"name": "suffix"
}
],
"etymology_text": "totalist + -ic",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "totalistic (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"glosses": [
"Of or relating to totalism."
],
"links": [
[
"totalism",
"totalism"
]
],
"tags": [
"not-comparable"
]
},
{
"categories": [
"English terms with quotations",
"en:Cellular automata"
],
"examples": [
{
"ref": "1989 March 21, Mark Kramer, “Fast LIFE (was: Re: summing 9-cell neighborhoods)”, in comp.theory.cell-automata (Usenet)",
"text": "BTW: Of course the rules were parametrised, so any totalistic 2-dimensional 9-neighbourhood CA could be run.",
"type": "quotation"
},
{
"ref": "1993 January 17, Dan Gordon, “Universal Cellular Automata.”, in comp.theory.cell-automata (Usenet)",
"text": "Note that the game of life is not totalistic: the transition function depends on the cell's own state and on the sum of the neighboring states.",
"type": "quotation"
},
{
"ref": "1994 July 3, Serge Winitzki, “Optimizing \"bitblt\" functions using Xor”, in comp.theory.cell-automata (Usenet)",
"text": "The Xor operation drastically cuts down the number of operations when dealing with totalistic CA rules. For example, a function of four variables a, b, c, d, returning 1 iff there are exactly two ones and two zeros among its arguments, is represented by this Karnaugh diagram:",
"type": "quotation"
}
],
"glosses": [
"Having the state of each cell represented by a number, and the value of a cell dependent only on the sum of the values of nearby cells."
],
"links": [
[
"cellular automata",
"cellular automata"
],
[
"state",
"state"
],
[
"cell",
"cell"
],
[
"number",
"number"
],
[
"value",
"value"
],
[
"sum",
"sum"
]
],
"raw_glosses": [
"(cellular automata):",
"Having the state of each cell represented by a number, and the value of a cell dependent only on the sum of the values of nearby cells."
],
"tags": [
"not-comparable"
],
"topics": [
"cellular-automata",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"English terms with quotations",
"en:Cellular automata"
],
"examples": [
{
"ref": "1999 September 2, J. Elliott, “ANNOUNCE: WebsideCA Java applet update”, in comp.theory.cell-automata (Usenet)",
"text": "Many good applets run Moore binary totalistic rules such as Conway's Life, but WebsideCA also runs von Neumann rules, rules in the \"Brian's Brain\" family, non-totalistic binary and decay rules, and Cyclic rules.",
"type": "quotation"
},
{
"ref": "2000 August 20, Gerard Vriens, “Discussion: neighbourhoods”, in comp.theory.cell-automata (Usenet)",
"text": "Since Life is totalistic on 8 neighbours, this requires no extra assumptions.",
"type": "quotation"
},
{
"ref": "2001 October 31, Erik Francis, “Four new rules with replicators”, in comp.theory.cell-automata (Usenet)",
"text": "... but the B/S notation is _the_ standard for two-state totalistic rules.",
"type": "quotation"
}
],
"glosses": [
"Outer totalistic."
],
"links": [
[
"cellular automata",
"cellular automata"
],
[
"Outer totalistic",
"Outer totalistic"
]
],
"raw_glosses": [
"(cellular automata):",
"Outer totalistic."
],
"tags": [
"not-comparable"
],
"topics": [
"cellular-automata",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"translations": [
{
"code": "mi",
"lang": "Maori",
"sense": "relating to the doctrine of totalitarianism",
"word": "angangarengare"
}
],
"word": "totalistic"
}
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-05-03 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.