Blum's speedup theorem in English

[Show JSON for post-processed kaikki.org data shown on this page ▼] [Hide JSON for post-processed kaikki.org data shown on this page ▲]

{
  "etymology_text": "First stated by Manuel Blum in 1967.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Blum's speedup theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "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": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A fundamental theorem about the complexity of computable functions, stating that for any complexity measure there are computable functions that are not optimal with respect to that measure."
      ],
      "id": "en-Blum's_speedup_theorem-en-name-08JKXkQn",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "complexity",
          "complexity"
        ],
        [
          "computable function",
          "computable function"
        ],
        [
          "measure",
          "measure"
        ],
        [
          "optimal",
          "optimal"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A fundamental theorem about the complexity of computable functions, stating that for any complexity measure there are computable functions that are not optimal with respect to that measure."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Blum's speedup theorem"
      ]
    }
  ],
  "word": "Blum's speedup theorem"
}

[Show JSON for raw wiktextract data ▼] [Hide JSON for raw wiktextract data ▲]

{
  "etymology_text": "First stated by Manuel Blum in 1967.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Blum's speedup theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "en:Theory of computing"
      ],
      "glosses": [
        "A fundamental theorem about the complexity of computable functions, stating that for any complexity measure there are computable functions that are not optimal with respect to that measure."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "complexity",
          "complexity"
        ],
        [
          "computable function",
          "computable function"
        ],
        [
          "measure",
          "measure"
        ],
        [
          "optimal",
          "optimal"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A fundamental theorem about the complexity of computable functions, stating that for any complexity measure there are computable functions that are not optimal with respect to that measure."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Blum's speedup theorem"
      ]
    }
  ],
  "word": "Blum's speedup theorem"
}

This page is a part of the kaikki.org machine-readable English 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.

"Blum's speedup theorem" meaning in English

Proper name