Toward an abstract theory of data compression
type: Item
instance of: scholarly article
title: Toward an abstract theory of data compression
zbMATH Open document ID: 0539.68032
DOI: 10.1016/0304-3975(83)90001-4
author: James A. Storer
published in: Theoretical Computer Science
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 3858407
zbMATH Keywords: data compression
zbMATH Keywords: recursive function
zbMATH Keywords: Gödel numbering
zbMATH Keywords: undecidable problem
zbMATH Keywords: computational complexity
zbMATH Keywords: abstract program size complexity
zbMATH Keywords: abstract compression scheme
MaRDI profile type: Publication
full work available at URL: 0304-3975(83)90001-4
OpenAlex ID: W2058958590
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: On the size of machines
cites work: On Effective Procedures for Speeding Up Algorithms
cites work: On the Length of Programs for Computing Finite Binary Sequences
cites work: On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: Information-theoretic characterizations of recursive infinite strings
cites work: Noncomplex sequences: characterizations and examples
cites work: An Overview of the Theory of Computational Complexity
cites work: Computational complexity of formal translations
cites work: On Simple Goedel Numberings and Translations
cites work: Q3214803
cites work: Q5681915
cites work: A variant of the Kolmogorov concept of complexity
cites work: Q4163522
cites work: Gödel numberings of partial recursive functions
cites work: Optimal enumerations and optimal gödel numberings
description: scientific article; zbMATH DE number 3858407