general recursion
A type of algorithm that continues until a criterion is satisfied, with no predetermined number of iterations; Gödel introduced this concept for his incompleteness theorem work
As defined in History of Science and Technology Q&A (February 8, 2023)
Where it comes up · 1
Most important claims · 1 of 1Search all claims for “general recursion” →
- Primitive recursion, a concept from early 20th-century mathematical logic, describes operations where you know in advance how many times you will loop; general recursion (which Gödel introduced for his incompleteness theorem work) describes operations where you continue until some criterion is satisfied, as exemplified by the Euclidean algorithm.History of Science and Technology Q&A (February 8, 2023)