𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Completeness in the arithmetical hierarchy and fixed points

✍ Scribed by M. M. Arslanov

Publisher
Springer US
Year
1989
Tongue
English
Weight
687 KB
Volume
28
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Completeness and fixed-points
Completeness and fixed-points
✍ P. V. Subrahmanyam πŸ“‚ Article πŸ“… 1975 πŸ› Springer Vienna 🌐 English βš– 341 KB
Quasi-completeness and functions without
Quasi-completeness and functions without fixed-points
✍ Ilnur I. Batyrshin πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 131 KB

## Abstract We prove a completeness criterion for quasi‐reducibility and generalize it to higher levels of the arithmetical hierarchy. As an application of the criterion we obtain Q‐completeness of the set of all pairs (__x__, __n__) such that the prefix‐free Kolmogorov complexity of __x__ is less

Numerical accuracy control in fixed-poin
Numerical accuracy control in fixed-point arithmetic
✍ Long Ton-That πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 516 KB

The purpose of this paper is to look at the problem of propagation of round-off errors in fixed-point arithmetic and at various problems of checking solutions of equations already treated by La Porte and Vignes in the case of floating-point arithmetic. We first consider the probabilistic model for t