"Kleene's recursion theorem" meaning in English

{
  "etymology_text": "Named after mathematician Stephen Cole Kleene.",
  "forms": [
    {
      "form": "Kleene's recursion theorems",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "s"
      },
      "expansion": "Kleene's recursion theorem (plural Kleene's recursion theorems)",
      "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": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "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": [
        "Either of are a pair of fundamental results about the application of computable functions to their own descriptions. They can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions."
      ],
      "id": "en-Kleene's_recursion_theorem-en-name-iLJPrcNV",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "fundamental",
          "fundamental"
        ],
        [
          "result",
          "result"
        ],
        [
          "application",
          "application"
        ],
        [
          "computable function",
          "computable function"
        ],
        [
          "description",
          "description"
        ],
        [
          "fixed point",
          "fixed point"
        ],
        [
          "operation",
          "operation"
        ],
        [
          "quine",
          "quine"
        ],
        [
          "function",
          "function"
        ],
        [
          "recursive",
          "recursive"
        ],
        [
          "definition",
          "definition"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Either of are a pair of fundamental results about the application of computable functions to their own descriptions. They can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions."
      ],
      "related": [
        {
          "word": "Kleene's theorem"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Kleene's recursion theorem"
}

{
  "etymology_text": "Named after mathematician Stephen Cole Kleene.",
  "forms": [
    {
      "form": "Kleene's recursion theorems",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "s"
      },
      "expansion": "Kleene's recursion theorem (plural Kleene's recursion theorems)",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "related": [
    {
      "word": "Kleene's theorem"
    }
  ],
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "Either of are a pair of fundamental results about the application of computable functions to their own descriptions. They can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "fundamental",
          "fundamental"
        ],
        [
          "result",
          "result"
        ],
        [
          "application",
          "application"
        ],
        [
          "computable function",
          "computable function"
        ],
        [
          "description",
          "description"
        ],
        [
          "fixed point",
          "fixed point"
        ],
        [
          "operation",
          "operation"
        ],
        [
          "quine",
          "quine"
        ],
        [
          "function",
          "function"
        ],
        [
          "recursive",
          "recursive"
        ],
        [
          "definition",
          "definition"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Either of are a pair of fundamental results about the application of computable functions to their own descriptions. They can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Kleene's recursion theorem"
}