scientific article; zbMATH DE number 1048038

MaRDI QIDQ4348124zbMATH OpenFDO

Authors José L. Balcázar, Ricard Gavaldà, M. Hermo

Publication date 22 September 1997

zbMATH Keywords

compressibilityinfinite binary sequencesKolmogorov complexitypolynomial-time computableresource bounds

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Compressibility and uniform complexity
• Time-bounded incompressibility of compressible strings and sequences
• Kobayashi compressibility
• Compressibility and resource bounded measure
• Kolmogorov-Complexity Based on Infinite Computations

Cited in

(7)

• Compressibility and uniform complexity
• scientific article; zbMATH DE number 1506505 (Why is no real title available?)
• Compressibility of Deterministic and Random Infinite Sequences
• scientific article; zbMATH DE number 1421006 (Why is no real title available?)
• Kobayashi compressibility
• Finite State Incompressible Infinite Sequences
• Time-bounded incompressibility of compressible strings and sequences

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4348124)