recursive function
C27361
concept
A recursive function is a function that solves a problem by calling itself with modified arguments until reaching a base case that stops the recursion.
All labels observed (2)
| Label | Occurrences |
|---|---|
| recursive function canonical | 1 |
| recursive procedure | 1 |
Description generation (CDg)
The one-sentence description above was generated by prompting gpt-5.1 with the class name and this instruction.
Instruction
generate a one-sentence description for a given conceptual class. # Response Format Return only the sentence: "Description: [one-sentence description of the conceptional class]"
Input
Class: recursive function
Generated description
A recursive function is a function that solves a problem by calling itself with modified arguments until reaching a base case that stops the recursion.
Instances (2)
| Instance | Via concept surface |
|---|---|
| Ackermann function | — |
| Schur algorithm | recursive procedure |