This article is cited in 1 paper

Recursively compressible sets

V. K. Bulitko

I. I. Mechnikov Odessa National University

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.

UDC: 517.1

Received: 14.08.1996
Revised: 10.06.1997

DOI: 10.4213/mzm1367

 English version: Mathematical Notes, 1998, 64:1, 8–14

Bibliographic databases:

• 
• 
•