Toward an abstract theory of data compression
DOI10.1016/0304-3975(83)90001-4zbMATH Open0539.68032OpenAlexW2058958590MaRDI QIDQ794162FDOQ794162
Authors: James A. Storer 
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90001-4
Recommendations
computational complexitydata compressionrecursive functionundecidable problemabstract compression schemeabstract program size complexityGödel numbering
Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Title not available (Why is that?)
- On the Length of Programs for Computing Finite Binary Sequences
- A Theory of Program Size Formally Identical to Information Theory
- On the Length of Programs for Computing Finite Binary Sequences
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A variant of the Kolmogorov concept of complexity
- Information-theoretic characterizations of recursive infinite strings
- On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
- Gödel numberings of partial recursive functions
- On the size of machines
- On Effective Procedures for Speeding Up Algorithms
- Title not available (Why is that?)
- An Overview of the Theory of Computational Complexity
- Optimal enumerations and optimal gödel numberings
- Computational complexity of formal translations
- Noncomplex sequences: characterizations and examples
- Title not available (Why is that?)
- On Simple Goedel Numberings and Translations
Cited In (18)
- Data compression using an ``imaginary sliding window
- Inequalities and algorithms for universal data compression
- About one formal schemes of information compression
- Distributed Compression through the Lens of Algorithmic Information Theory: A Primer
- Title not available (Why is that?)
- A theory of incremental compression
- Title not available (Why is that?)
- ?-Entropy data compression
- Compression is Comprehension and the Unreasonable Effectiveness of Digital Computation in the Natural World
- Effective entropies and data compression
- Statistical mechanics of the data compression theorem
- Title not available (Why is that?)
- Learning as Data Compression
- Title not available (Why is that?)
- Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
- The macro model for data compression (extended abstract)
- DAS KOMPRESSIONSTHEOREM FÜR TEMPOMASZE
- Functional programs as compressed data
This page was built for publication: Toward an abstract theory of data compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794162)
