"Turing tarpit" meaning in English

See Turing tarpit in All languages combined, or Wiktionary

Noun

Forms: Turing tarpits [plural]
Etymology: Coined by Alan Perlis (1922-1990), computer scientist, from the name of Alan Turing (1912-1954), who described a basis for all possible computational algorithms, and tarpit. Head templates: {{en-noun}} Turing tarpit (plural Turing tarpits)
  1. (computing) The situation in which a programming language is only minimally Turing complete, so that "everything is possible but nothing is easy". Wikipedia link: Alan Perlis, Alan Turing, Turing tarpit Categories (topical): Computing Synonyms: Turing Tarpit

Inflected forms

Alternative forms

Download JSON data for Turing tarpit meaning in English (2.4kB)

{
  "etymology_text": "Coined by Alan Perlis (1922-1990), computer scientist, from the name of Alan Turing (1912-1954), who described a basis for all possible computational algorithms, and tarpit.",
  "forms": [
    {
      "form": "Turing tarpits",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Turing tarpit (plural Turing tarpits)",
      "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": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computing",
          "orig": "en:Computing",
          "parents": [
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1985, Jean-Paul Tremblay, Paul G Sorenson, The Theory and Practice of Compiler Writing",
          "text": "The basic reason for increasing the size of the language is the so-called Turing tarpit: if the language is too simple, one may be able to do anything in it.",
          "type": "quotation"
        },
        {
          "ref": "1994, Jørgen Lindskov Knudsen, Object-oriented Environments: The Mjolner Approach",
          "text": "Without more abstract notions of what constitutes important aspects of a programming language, one is seriously in danger of falling into the Turing Tarpit.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "The situation in which a programming language is only minimally Turing complete, so that \"everything is possible but nothing is easy\"."
      ],
      "id": "en-Turing_tarpit-en-noun-BZIr4La1",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "programming language",
          "programming language"
        ],
        [
          "minimally",
          "minimally"
        ],
        [
          "Turing complete",
          "Turing complete"
        ]
      ],
      "raw_glosses": [
        "(computing) The situation in which a programming language is only minimally Turing complete, so that \"everything is possible but nothing is easy\"."
      ],
      "synonyms": [
        {
          "word": "Turing Tarpit"
        }
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Alan Perlis",
        "Alan Turing",
        "Turing tarpit"
      ]
    }
  ],
  "word": "Turing tarpit"
}
{
  "etymology_text": "Coined by Alan Perlis (1922-1990), computer scientist, from the name of Alan Turing (1912-1954), who described a basis for all possible computational algorithms, and tarpit.",
  "forms": [
    {
      "form": "Turing tarpits",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Turing tarpit (plural Turing tarpits)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English terms with quotations",
        "Quotation templates to be cleaned",
        "en:Computing"
      ],
      "examples": [
        {
          "ref": "1985, Jean-Paul Tremblay, Paul G Sorenson, The Theory and Practice of Compiler Writing",
          "text": "The basic reason for increasing the size of the language is the so-called Turing tarpit: if the language is too simple, one may be able to do anything in it.",
          "type": "quotation"
        },
        {
          "ref": "1994, Jørgen Lindskov Knudsen, Object-oriented Environments: The Mjolner Approach",
          "text": "Without more abstract notions of what constitutes important aspects of a programming language, one is seriously in danger of falling into the Turing Tarpit.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "The situation in which a programming language is only minimally Turing complete, so that \"everything is possible but nothing is easy\"."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "programming language",
          "programming language"
        ],
        [
          "minimally",
          "minimally"
        ],
        [
          "Turing complete",
          "Turing complete"
        ]
      ],
      "raw_glosses": [
        "(computing) The situation in which a programming language is only minimally Turing complete, so that \"everything is possible but nothing is easy\"."
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Alan Perlis",
        "Alan Turing",
        "Turing tarpit"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "Turing Tarpit"
    }
  ],
  "word": "Turing tarpit"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-06-04 from the enwiktionary dump dated 2024-05-02 using wiktextract (e9e0a99 and db5a844). 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.