|
This article is cited in 1 scientific paper (total 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.
Received: 14.08.1996 Revised: 10.06.1997
Citation:
V. K. Bulitko, “Recursively compressible sets”, Mat. Zametki, 64:1 (1998), 9–16; Math. Notes, 64:1 (1998), 8–14
Linking options:
https://www.mathnet.ru/eng/mzm1367https://doi.org/10.4213/mzm1367 https://www.mathnet.ru/eng/mzm/v64/i1/p9
|
Statistics & downloads: |
Abstract page: | 399 | Full-text PDF : | 170 | References: | 64 | First page: | 2 |
|