Recursively compressible sets

DOI10.1007/BF02307190zbMath0919.03038MaRDI QIDQ1282502

V. K. Bulitko

Publication date: 11 April 1999

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

complexityTuring reducibilitycompleteness of recursively enumerable setsdata packingrecursively compressible setsrecursively incompressible sets

Mathematics Subject Classification ID

Theory of data (68P99) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Unnamed Item
• Unnamed Item
• Sub-Turing reducibilities of restricted complexity
• A variant of the Kolmogorov concept of complexity
• Complexity oscillations in infinite binary sequences
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: Recursively compressible sets