Compressibility of infinite binary sequences
Year: 1996
Type: report
Abstract: It is known that infinite binary sequences of constant \nKolmogorov complexity are exactly the recursive ones.\nSuch a kind of statement no longer holds in the presence of resource bounds.\nContrary to what intuition might suggest, there are sequences of \nconstant, polynomial-time bounded Kolmogorov complexity that are \nnot polynomial-time computable. This motivates the study of \nseveral resource-bounded variants in search for a characterization,\nsimilar in spirit, of the polynomial-time computable sequences.\nWe propose some definitions, based on Kobayashi's notion of\ncompressibility, and compare them to both the standard resource-bounded\nKolmogorov complexity of infinite strings, and the uniform complexity.\nSome nontrivial coincidences and disagreements are proved. \nThe resource-unbounded case is also considered.
Authors: Balcázar Navarro, José Luis, Gavaldà Mestre, Ricard, Hermo Huguet, Montserrat
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7018000671
