Generation Complexity Versus Distinction Complexity

DOI10.1007/978-3-540-79228-4_40zbMath1140.68027OpenAlexW2119964139MaRDI QIDQ3502669

Wolfgang Merkle, Rupert Hölzl

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_40

zbMATH Keywords

resource-bounded Kolmogorov complexity

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Unnamed Item
• On resource-bounded instance complexity
• Resource-Bounded Kolmogorov Complexity Revisited
• Randomness conservation inequalities; information and independence in mathematical theories

This page was built for publication: Generation Complexity Versus Distinction Complexity