"busy beaver function" meaning in English

See busy beaver function in All languages combined, or Wiktionary

Noun

Forms: busy beaver functions [plural]
Head templates: {{en-noun}} busy beaver function (plural busy beaver functions)
  1. (mathematics, computing theory) The mathematical function, denoted by Σ(n), that maps each positive integer n to the number of steps required for the busy beaver among machines with two colors and n states to terminate. Categories (topical): Functions, Mathematics, Theory of computing

Inflected forms

Download JSON data for busy beaver function meaning in English (2.2kB)

{
  "forms": [
    {
      "form": "busy beaver functions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "busy beaver function (plural busy beaver functions)",
      "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 topic categories using raw markup",
          "parents": [
            "Entries with topic 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": "Functions",
          "orig": "en:Functions",
          "parents": [
            "Algebra",
            "Calculus",
            "Geometry",
            "Mathematical analysis",
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "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": [
        "The mathematical function, denoted by Σ(n), that maps each positive integer n to the number of steps required for the busy beaver among machines with two colors and n states to terminate."
      ],
      "id": "en-busy_beaver_function-en-noun-uj60sSFt",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "Σ(n)",
          "Σ"
        ],
        [
          "busy beaver",
          "busy beaver"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computing theory) The mathematical function, denoted by Σ(n), that maps each positive integer n to the number of steps required for the busy beaver among machines with two colors and n states to terminate."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "busy beaver function"
}
{
  "forms": [
    {
      "form": "busy beaver functions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "busy beaver function (plural busy beaver functions)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with topic categories using raw markup",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "en:Functions",
        "en:Mathematics",
        "en:Theory of computing"
      ],
      "glosses": [
        "The mathematical function, denoted by Σ(n), that maps each positive integer n to the number of steps required for the busy beaver among machines with two colors and n states to terminate."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "Σ(n)",
          "Σ"
        ],
        [
          "busy beaver",
          "busy beaver"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computing theory) The mathematical function, denoted by Σ(n), that maps each positive integer n to the number of steps required for the busy beaver among machines with two colors and n states to terminate."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "busy beaver function"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-05 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.