𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Completeness and fixed-points

✍ Scribed by P. V. Subrahmanyam


Publisher
Springer Vienna
Year
1975
Tongue
English
Weight
341 KB
Volume
80
Category
Article
ISSN
0026-9255

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Quasi-completeness and functions without
✍ 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