"fonction d’Ackermann" meaning in Français

{
  "categories": [
    {
      "kind": "other",
      "name": "Noms propres en français",
      "parents": [],
      "source": "w"
    },
    {
      "kind": "other",
      "name": "Traductions en anglais",
      "parents": [],
      "source": "w"
    },
    {
      "kind": "other",
      "name": "Français",
      "orig": "français",
      "parents": [],
      "source": "w"
    }
  ],
  "etymology_texts": [
    "Nommé d'après Wilhelm Ackermann."
  ],
  "lang": "Français",
  "lang_code": "fr",
  "notes": [
    "Formellement, la fonction se défini comme :",
    "A(m,n)=",
    "\\begin{cases}\n n+1 & \\mbox{si } m = 0 \\\\\n A(m-1, 1) & \\mbox{si } m > 0 \\mbox{ et } n = 0 \\\\\n A(m-1, A(m, n-1)) & \\mbox{si } m > 0 \\mbox{ et } n > 0.\n \\end{cases}"
  ],
  "pos": "name",
  "pos_title": "Nom propre",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "Lexique en français de l’informatique",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Lexique en français des mathématiques",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Wiktionnaire:Exemples manquants en français",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "Fonction récursive non récursive primitive."
      ],
      "id": "fr-fonction_d’Ackermann-fr-name-qF90TORN",
      "topics": [
        "computing",
        "mathematics"
      ]
    }
  ],
  "tags": [
    "feminine"
  ],
  "translations": [
    {
      "lang": "Anglais",
      "lang_code": "en",
      "word": "Ackermann function"
    }
  ],
  "word": "fonction d’Ackermann"
}

{
  "categories": [
    "Noms propres en français",
    "Traductions en anglais",
    "français"
  ],
  "etymology_texts": [
    "Nommé d'après Wilhelm Ackermann."
  ],
  "lang": "Français",
  "lang_code": "fr",
  "notes": [
    "Formellement, la fonction se défini comme :",
    "A(m,n)=",
    "\\begin{cases}\n n+1 & \\mbox{si } m = 0 \\\\\n A(m-1, 1) & \\mbox{si } m > 0 \\mbox{ et } n = 0 \\\\\n A(m-1, A(m, n-1)) & \\mbox{si } m > 0 \\mbox{ et } n > 0.\n \\end{cases}"
  ],
  "pos": "name",
  "pos_title": "Nom propre",
  "senses": [
    {
      "categories": [
        "Lexique en français de l’informatique",
        "Lexique en français des mathématiques",
        "Wiktionnaire:Exemples manquants en français"
      ],
      "glosses": [
        "Fonction récursive non récursive primitive."
      ],
      "topics": [
        "computing",
        "mathematics"
      ]
    }
  ],
  "tags": [
    "feminine"
  ],
  "translations": [
    {
      "lang": "Anglais",
      "lang_code": "en",
      "word": "Ackermann function"
    }
  ],
  "word": "fonction d’Ackermann"
}