𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decidability results for primitive recursive algorithms

✍ Scribed by R David

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
360 KB
Volume
300
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Limit theorems for recursive algorithms
Limit theorems for recursive algorithms
✍ P Feldman; S.T Rachev; L RΓΌschendorf πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 769 KB