About primitive recursive algorithms
✍ Scribed by Loïc Colson
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 995 KB
- Volume
- 83
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
## Abstract In mathematics, various representations of real numbers have been investigated. All these representations are mathematically equivalent because they lead to the same real structure – Dedekind‐complete ordered field. Even the effective versions of these representations are equivalent in