𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On list primitive recursion and the complexity of computinginf

✍ Scribed by Loïc Colson

Book ID
105430751
Publisher
Springer Netherlands
Year
1992
Tongue
English
Weight
249 KB
Volume
32
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of recursion in proble
On the complexity of recursion in problem-solving
✍ M.C. Er 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 426 KB

The importance of paying attention to the complexity of recursion in problem solving is stressed. Many ill-founded beliefs and doctrines on constructing recursive algorithms are challenged. The Tower of Hanoi problem and its variant are used as concrete examples for illustrating that many seemingly

On primitive recursive algorithms and th
On primitive recursive algorithms and the greatest common divisor function
✍ Yiannis N. Moschovakis 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 341 KB

We establish linear lower bounds for the complexity of non-trivial, primitive recursive algorithms from piecewise linear given functions. The main corollary is that logtime algorithms for the greatest common divisor from such givens (such as Stein's) cannot be matched in e ciency by primitive recurs