"recursive function" meaning in All languages combined

See recursive function on Wiktionary

Noun [English]

Forms: recursive functions [plural]
Head templates: {{en-noun}} recursive function (plural recursive functions)
  1. (computing) Any function that uses recursion and can call itself until a certain condition is met. Categories (topical): Computing, Functions Hypernyms: function Hyponyms: partial recursive function, primitive recursive function
    Sense id: en-recursive_function-en-noun-2GnGuemh Disambiguation of Functions: 65 35 Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries Disambiguation of English entries with incorrect language header: 59 41 Disambiguation of Pages with 1 entry: 59 41 Disambiguation of Pages with entries: 61 39 Topics: computing, engineering, mathematics, natural-sciences, physical-sciences, sciences
  2. (mathematics) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm. Categories (topical): Mathematics
    Sense id: en-recursive_function-en-noun-BIUf3gyN Topics: mathematics, sciences

Inflected forms

{
  "forms": [
    {
      "form": "recursive functions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "recursive function (plural recursive functions)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computing",
          "orig": "en:Computing",
          "parents": [
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "59 41",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "59 41",
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "61 39",
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "65 35",
          "kind": "topical",
          "langcode": "en",
          "name": "Functions",
          "orig": "en:Functions",
          "parents": [
            "Algebra",
            "Calculus",
            "Geometry",
            "Mathematical analysis",
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w+disamb"
        }
      ],
      "glosses": [
        "Any function that uses recursion and can call itself until a certain condition is met."
      ],
      "hypernyms": [
        {
          "_dis1": "72 28",
          "word": "function"
        }
      ],
      "hyponyms": [
        {
          "_dis1": "72 28",
          "word": "partial recursive function"
        },
        {
          "_dis1": "72 28",
          "word": "primitive recursive function"
        }
      ],
      "id": "en-recursive_function-en-noun-2GnGuemh",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "recursion",
          "recursion"
        ],
        [
          "condition",
          "condition"
        ]
      ],
      "raw_glosses": [
        "(computing) Any function that uses recursion and can call itself until a certain condition is met."
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
      ],
      "id": "en-recursive_function-en-noun-BIUf3gyN",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "value",
          "value"
        ],
        [
          "finite",
          "finite"
        ],
        [
          "operation",
          "operation"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(mathematics) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "Computable function",
    "Recursion (computer science)"
  ],
  "word": "recursive function"
}
{
  "categories": [
    "English countable nouns",
    "English entries with incorrect language header",
    "English lemmas",
    "English multiword terms",
    "English nouns",
    "Pages with 1 entry",
    "Pages with entries",
    "en:Functions"
  ],
  "forms": [
    {
      "form": "recursive functions",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "recursive function (plural recursive functions)",
      "name": "en-noun"
    }
  ],
  "hypernyms": [
    {
      "word": "function"
    }
  ],
  "hyponyms": [
    {
      "word": "partial recursive function"
    },
    {
      "word": "primitive recursive function"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "en:Computing"
      ],
      "glosses": [
        "Any function that uses recursion and can call itself until a certain condition is met."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "recursion",
          "recursion"
        ],
        [
          "condition",
          "condition"
        ]
      ],
      "raw_glosses": [
        "(computing) Any function that uses recursion and can call itself until a certain condition is met."
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    },
    {
      "categories": [
        "en:Mathematics"
      ],
      "glosses": [
        "Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "value",
          "value"
        ],
        [
          "finite",
          "finite"
        ],
        [
          "operation",
          "operation"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(mathematics) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "Computable function",
    "Recursion (computer science)"
  ],
  "word": "recursive function"
}

Download raw JSONL data for recursive function meaning in All languages combined (1.6kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.