On Languages with Very High Space-Bounded Kolmogorov Complexity

DOI10.1137/0222029zbMATH Open0770.68053OpenAlexW2075130353MaRDI QIDQ4032946FDOQ4032946

Authors: Ronald V. Book, Jack H. Lutz 

Publication date: 17 May 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222029

Recommendations

• scientific article; zbMATH DE number 3988704
• Power from Random Strings
• scientific article; zbMATH DE number 107775
• Randomness is hard
• Mathematical Foundations of Computer Science 2004

zbMATH Keywords

Kolmogorov complexitysparse setsexponential spacebounded truth- table reducible

Mathematics Subject Classification ID

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

Cited In (8)

• Mathematical Foundations of Computer Science 2004
• Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity
• A new complete language for DSPACE(log n)
• Title not available (Why is that?)
• Refined Bounds on Kolmogorov Complexity for ω-Languages
• Enumerations of the Kolmogorov function
• Inequalities for space-bounded Kolmogorov complexity
• Title not available (Why is that?)

This page was built for publication: On Languages with Very High Space-Bounded Kolmogorov Complexity

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