"Ackermann function" meaning in English

See Ackermann function in All languages combined, or Wiktionary

Proper name

Etymology: Named after Wilhelm Ackermann. Etymology templates: {{!}} |, {{lang|en|Wilhelm Ackermann}} Wilhelm Ackermann, {{named-after|en|Wilhelm Ackermann|wplink=Wilhelm Ackermann}} Named after Wilhelm Ackermann Head templates: {{en-prop}} Ackermann function
  1. (computing theory) One of the simplest and earliest examples of a total computable function that is not primitive recursive. Wikipedia link: Ackermann function Categories (topical): Functions, Theory of computing Translations (a total computable function that is not primitive recursive): Akermana funkcio (Esperanto), Ackermannin funktio (Finnish), função de Ackermann [feminine] (Portuguese)

Download JSON data for Ackermann function meaning in English (2.6kB)

{
  "etymology_templates": [
    {
      "args": {},
      "expansion": "|",
      "name": "!"
    },
    {
      "args": {
        "1": "en",
        "2": "Wilhelm Ackermann"
      },
      "expansion": "Wilhelm Ackermann",
      "name": "lang"
    },
    {
      "args": {
        "1": "en",
        "2": "Wilhelm Ackermann",
        "wplink": "Wilhelm Ackermann"
      },
      "expansion": "Named after Wilhelm Ackermann",
      "name": "named-after"
    }
  ],
  "etymology_text": "Named after Wilhelm Ackermann.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Ackermann function",
      "name": "en-prop"
    }
  ],
  "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 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": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "One of the simplest and earliest examples of a total computable function that is not primitive recursive."
      ],
      "id": "en-Ackermann_function-en-name-9ejPjRsf",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "total",
          "total"
        ],
        [
          "computable function",
          "computable function"
        ],
        [
          "primitive recursive",
          "primitive recursive"
        ]
      ],
      "raw_glosses": [
        "(computing theory) One of the simplest and earliest examples of a total computable function that is not primitive recursive."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "translations": [
        {
          "code": "eo",
          "lang": "Esperanto",
          "sense": "a total computable function that is not primitive recursive",
          "word": "Akermana funkcio"
        },
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "a total computable function that is not primitive recursive",
          "word": "Ackermannin funktio"
        },
        {
          "code": "pt",
          "lang": "Portuguese",
          "sense": "a total computable function that is not primitive recursive",
          "tags": [
            "feminine"
          ],
          "word": "função de Ackermann"
        }
      ],
      "wikipedia": [
        "Ackermann function"
      ]
    }
  ],
  "word": "Ackermann function"
}
{
  "etymology_templates": [
    {
      "args": {},
      "expansion": "|",
      "name": "!"
    },
    {
      "args": {
        "1": "en",
        "2": "Wilhelm Ackermann"
      },
      "expansion": "Wilhelm Ackermann",
      "name": "lang"
    },
    {
      "args": {
        "1": "en",
        "2": "Wilhelm Ackermann",
        "wplink": "Wilhelm Ackermann"
      },
      "expansion": "Named after Wilhelm Ackermann",
      "name": "named-after"
    }
  ],
  "etymology_text": "Named after Wilhelm Ackermann.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Ackermann function",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English entries with topic 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:Functions",
        "en:Theory of computing"
      ],
      "glosses": [
        "One of the simplest and earliest examples of a total computable function that is not primitive recursive."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "total",
          "total"
        ],
        [
          "computable function",
          "computable function"
        ],
        [
          "primitive recursive",
          "primitive recursive"
        ]
      ],
      "raw_glosses": [
        "(computing theory) One of the simplest and earliest examples of a total computable function that is not primitive recursive."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Ackermann function"
      ]
    }
  ],
  "translations": [
    {
      "code": "eo",
      "lang": "Esperanto",
      "sense": "a total computable function that is not primitive recursive",
      "word": "Akermana funkcio"
    },
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "a total computable function that is not primitive recursive",
      "word": "Ackermannin funktio"
    },
    {
      "code": "pt",
      "lang": "Portuguese",
      "sense": "a total computable function that is not primitive recursive",
      "tags": [
        "feminine"
      ],
      "word": "função de Ackermann"
    }
  ],
  "word": "Ackermann 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.