"Turing complete" meaning in English

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "Turing complete (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "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"
        }
      ],
      "examples": [
        {
          "ref": "2005, Ben Klemens, Math You Can't Use: Patents, Copyright, and Software, Brookings Institution Press, →ISBN, page 35:",
          "text": "All languages that are equivalent to Turing's specification are said to be Turing complete. Turing completeness is a surprisingly low bar. Many hand calculators can understand a Turing complete language. PDF (Portable Document Format), in which many documents on the Internet are available, is itself a Turing complete language.",
          "type": "quote"
        }
      ],
      "glosses": [
        "Equivalent in power to a universal Turing machine; equivalently, functionally complete."
      ],
      "id": "en-Turing_complete-en-adj-gH5ecRTe",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "universal Turing machine",
          "universal Turing machine"
        ],
        [
          "functionally complete",
          "functionally complete"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Equivalent in power to a universal Turing machine; equivalently, functionally complete."
      ],
      "related": [
        {
          "word": "Turing machine"
        },
        {
          "word": "universal Turing machine"
        },
        {
          "word": "functionally complete"
        },
        {
          "word": "recursive function"
        }
      ],
      "synonyms": [
        {
          "word": "Turing-complete"
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Turing complete"
}

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "Turing complete (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "related": [
    {
      "word": "Turing machine"
    },
    {
      "word": "universal Turing machine"
    },
    {
      "word": "functionally complete"
    },
    {
      "word": "recursive function"
    }
  ],
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English compound adjectives",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English terms with quotations",
        "English uncomparable adjectives",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "ref": "2005, Ben Klemens, Math You Can't Use: Patents, Copyright, and Software, Brookings Institution Press, →ISBN, page 35:",
          "text": "All languages that are equivalent to Turing's specification are said to be Turing complete. Turing completeness is a surprisingly low bar. Many hand calculators can understand a Turing complete language. PDF (Portable Document Format), in which many documents on the Internet are available, is itself a Turing complete language.",
          "type": "quote"
        }
      ],
      "glosses": [
        "Equivalent in power to a universal Turing machine; equivalently, functionally complete."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "universal Turing machine",
          "universal Turing machine"
        ],
        [
          "functionally complete",
          "functionally complete"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Equivalent in power to a universal Turing machine; equivalently, functionally complete."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "Turing-complete"
    }
  ],
  "word": "Turing complete"
}