Textbook examples of recursion
Donald E. Knuth
cs.CCarXiv:cs/9301113
Abstract
We discuss properties of recursive schemas related to McCarthy's ``91 function'' and to Takeuchi's triple recursion. Several theorems are proposed as interesting candidates for machine verification, and some intriguing open questions are raised.
Create a lesson
Related papers
How far is Kolmogorov-Loveland randomness from Martin-Löf randomness?
Tomislav Petrović
The Complexity of Finding Additional Solutions
Saman Farhat
On the Hardness of 4-to-1 Games with Perfect Completeness
Yumou Fei, Dor Minzer, Shuo Wang
Near-Inverse-Linear Barriers for Explicit Affine Witness Isolation
Sebastian Ben Daniel
∃ R ⊂eq CH
Alex Meiburg
Primal/Dual Method for the Grothendieck Constant
Steven Heilman, Chris Jones, Giulio Malavolta