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.

definitionpending

Speaker

Stephen Wolfram

Evidence Quote

“primitive recursion back in the beginning of the 1900s... General recursion which actually Gödel introduced for for his Gödel's theorem work um is something where you kind of keep going until some criterion is valid.”

Source

History of Science and Technology Q&A (February 8, 2023)— Wolfram
Created: 8/11/2026, 1:05:14 AM

Your notes

Loading notes...