"recursion theory" meaning in English

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "recursion theory (uncountable)",
      "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": "topical",
          "langcode": "en",
          "name": "Logic",
          "orig": "en:Logic",
          "parents": [
            "Formal sciences",
            "Philosophy",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as \"What does it mean for a function on the natural numbers to be computable?\" and \"Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?\"."
      ],
      "id": "en-recursion_theory-en-noun-Jzyp78jj",
      "links": [
        [
          "logic",
          "logic"
        ],
        [
          "mathematical logic",
          "mathematical logic"
        ],
        [
          "computable function",
          "computable function"
        ],
        [
          "Turing degree",
          "Turing degree"
        ]
      ],
      "raw_glosses": [
        "(logic) A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as \"What does it mean for a function on the natural numbers to be computable?\" and \"Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?\"."
      ],
      "synonyms": [
        {
          "word": "computability theory"
        }
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ],
      "wikipedia": [
        "recursion theory"
      ]
    }
  ],
  "word": "recursion theory"
}

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "recursion theory (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "en:Logic"
      ],
      "glosses": [
        "A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as \"What does it mean for a function on the natural numbers to be computable?\" and \"Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?\"."
      ],
      "links": [
        [
          "logic",
          "logic"
        ],
        [
          "mathematical logic",
          "mathematical logic"
        ],
        [
          "computable function",
          "computable function"
        ],
        [
          "Turing degree",
          "Turing degree"
        ]
      ],
      "raw_glosses": [
        "(logic) A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as \"What does it mean for a function on the natural numbers to be computable?\" and \"Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?\"."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ],
      "wikipedia": [
        "recursion theory"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "computability theory"
    }
  ],
  "word": "recursion theory"
}