Abstract
Classes of recursively compressible and incompressible sets as well as some other classes emerging in connection with a simple recursive-theory model of data array packing are studied. Some new completeness criteria for sets are obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. K. Bulitko, “Sub-Turing reducibilities of bounded complexity,”Izv. Vyssh. Uchebn. Zaved. Mat. [Russian Math. (Iz. VUZ)], No. 1, 27–37 (1992).
V. D. Solov'ev, “Structure of the information distribution in an infinite sequence,”Diskret. Mat. [Discrete Math. Appl.],8, No. 2, 97–107 (1996).
H. Rogers, Jr.,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York-St. Louis-San Francisco-Toronto-London-Sydney (1967).
Ya. M. Barzdin', “Complexity of programs recognizing the membership of positive integers not exceedingn in a recursively enumerable set,”Dokl. Akad. Nauk SSSR [Soviet Math. Dokl.],182, No. 6, 1249–1252 (1968).
A. N. Kolmogorov, “Three approaches to the definition of the concept of ‘information content’,”Problemy Peredachi Informatsii [Problems Inform. Transmission],1, No. 1, 3–11 (1965).
P. Martin-Löf, “Complexity oscillations in infinite binary sequences,”Z. Wahrscheinlichkeitsteorie Verw. Geb.,19, No. 3, 225–230 (1971).
C. G. Jockush and R. I. Soare, “π 01 -classes and degrees of theories,”Trans. Amer. Math. Soc.,173, 33–56 (1972).
D. W. Loveland, “A variant of the Kolmogorov concept of complexity,”Inform. and Control (Shenyang),15, 510–526 (1969).
Author information
Authors and Affiliations
Additional information
Translated fromMatematicheskie Zametki, Vol. 64, No. 1, pp. 9–16, July, 1998.
Rights and permissions
About this article
Cite this article
Bulitko, V.K. Recursively compressible sets. Math Notes 64, 8–14 (1998). https://doi.org/10.1007/BF02307190
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02307190