"comp.theorist" meaning in All languages combined

See comp.theorist on Wiktionary

Noun [English]

Forms: comp.theorists [plural]
Etymology: Blend of comp.theory + theorist. Equivalent to comp.theory + -ist. Etymology templates: {{blend|en|comp.theory|theorist}} Blend of comp.theory + theorist, {{suf|en|comp.theory|ist}} comp.theory + -ist Head templates: {{en-noun}} comp.theorist (plural comp.theorists)
  1. (Internet slang) A participant in the Usenet newsgroup comp.theory. Wikipedia link: comp.* hierarchy Tags: Internet Categories (topical): Computer science, Newsgroups, People

Inflected forms

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "comp.theory",
        "3": "theorist"
      },
      "expansion": "Blend of comp.theory + theorist",
      "name": "blend"
    },
    {
      "args": {
        "1": "en",
        "2": "comp.theory",
        "3": "ist"
      },
      "expansion": "comp.theory + -ist",
      "name": "suf"
    }
  ],
  "etymology_text": "Blend of comp.theory + theorist. Equivalent to comp.theory + -ist.",
  "forms": [
    {
      "form": "comp.theorists",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "comp.theorist (plural comp.theorists)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English blends",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English links with redundant wikilinks",
          "parents": [
            "Links with redundant wikilinks",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms suffixed with -ist",
          "parents": [],
          "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"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Newsgroups",
          "orig": "en:Newsgroups",
          "parents": [
            "Usenet",
            "Internet",
            "Computing",
            "Networking",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "People",
          "orig": "en:People",
          "parents": [
            "Human",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1992 April 20, Long Van Tran, “Request for Proof”, in comp.theory (Usenet), retrieved 2022-04-29:",
          "text": "Hello comp.theorist,\nI need the proof for the computability of\nSpeed problem : Find the fastest program P\nSP(i) = j | Pj is fastest (with Pj equivalent to Pi)\nIt is a kind of \"Halting problem\". This problem is not computable.\n(I may even describe the problem incorrectly!)",
          "type": "quote"
        },
        {
          "ref": "1993 July 13, Davide Crippa, “Travelling Salesman Problem”, in comp.theory (Usenet), retrieved 2022-04-29:",
          "text": "Hi Comp.Theorists,\nI am looking for an overview article treating the TSP problem. I am NOT looking for a book like Lawler, Lenstra,..., just an article written for broad diffusion, something that could for instance appear in Scientific American or some other kind of journal, and that would give beside the statement of the problem also an overview on the heuristics, achieved results, etc.",
          "type": "quote"
        },
        {
          "ref": "2002 February 26, Fabien, “Non-destructive graph unification algorithm”, in comp.theory (Usenet), retrieved 2022-04-29:",
          "text": "Dear comp.theorists,\nI need to implement a - possibly efficient - feature-structure unification algorithm in a pure functional settings^([sic]).",
          "type": "quote"
        }
      ],
      "glosses": [
        "A participant in the Usenet newsgroup comp.theory."
      ],
      "id": "en-comp.theorist-en-noun-MDhCmgZj",
      "links": [
        [
          "Internet",
          "Internet"
        ],
        [
          "slang",
          "slang"
        ],
        [
          "Usenet",
          "Usenet"
        ],
        [
          "newsgroup",
          "newsgroup"
        ]
      ],
      "raw_glosses": [
        "(Internet slang) A participant in the Usenet newsgroup comp.theory."
      ],
      "tags": [
        "Internet"
      ],
      "wikipedia": [
        "comp.* hierarchy"
      ]
    }
  ],
  "word": "comp.theorist"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "comp.theory",
        "3": "theorist"
      },
      "expansion": "Blend of comp.theory + theorist",
      "name": "blend"
    },
    {
      "args": {
        "1": "en",
        "2": "comp.theory",
        "3": "ist"
      },
      "expansion": "comp.theory + -ist",
      "name": "suf"
    }
  ],
  "etymology_text": "Blend of comp.theory + theorist. Equivalent to comp.theory + -ist.",
  "forms": [
    {
      "form": "comp.theorists",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "comp.theorist (plural comp.theorists)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English blends",
        "English countable nouns",
        "English entries with incorrect language header",
        "English internet slang",
        "English lemmas",
        "English links with redundant wikilinks",
        "English nouns",
        "English terms spelled with .",
        "English terms suffixed with -ist",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science",
        "en:Newsgroups",
        "en:People"
      ],
      "examples": [
        {
          "ref": "1992 April 20, Long Van Tran, “Request for Proof”, in comp.theory (Usenet), retrieved 2022-04-29:",
          "text": "Hello comp.theorist,\nI need the proof for the computability of\nSpeed problem : Find the fastest program P\nSP(i) = j | Pj is fastest (with Pj equivalent to Pi)\nIt is a kind of \"Halting problem\". This problem is not computable.\n(I may even describe the problem incorrectly!)",
          "type": "quote"
        },
        {
          "ref": "1993 July 13, Davide Crippa, “Travelling Salesman Problem”, in comp.theory (Usenet), retrieved 2022-04-29:",
          "text": "Hi Comp.Theorists,\nI am looking for an overview article treating the TSP problem. I am NOT looking for a book like Lawler, Lenstra,..., just an article written for broad diffusion, something that could for instance appear in Scientific American or some other kind of journal, and that would give beside the statement of the problem also an overview on the heuristics, achieved results, etc.",
          "type": "quote"
        },
        {
          "ref": "2002 February 26, Fabien, “Non-destructive graph unification algorithm”, in comp.theory (Usenet), retrieved 2022-04-29:",
          "text": "Dear comp.theorists,\nI need to implement a - possibly efficient - feature-structure unification algorithm in a pure functional settings^([sic]).",
          "type": "quote"
        }
      ],
      "glosses": [
        "A participant in the Usenet newsgroup comp.theory."
      ],
      "links": [
        [
          "Internet",
          "Internet"
        ],
        [
          "slang",
          "slang"
        ],
        [
          "Usenet",
          "Usenet"
        ],
        [
          "newsgroup",
          "newsgroup"
        ]
      ],
      "raw_glosses": [
        "(Internet slang) A participant in the Usenet newsgroup comp.theory."
      ],
      "tags": [
        "Internet"
      ],
      "wikipedia": [
        "comp.* hierarchy"
      ]
    }
  ],
  "word": "comp.theorist"
}

Download raw JSONL data for comp.theorist meaning in All languages combined (2.6kB)


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.