Two Problems for Sophistication

DOI10.1007/978-3-319-24486-0_25zbMath1471.68096OpenAlexW2295601141WikidataQ54839670 ScholiaQ54839670MaRDI QIDQ2835644

Steven de Rooij, Peter Bloem, Pieter Adriaans

Publication date: 30 November 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-24486-0_25

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sophistication vs logical depth
• Information measures, effective complexity, and total information
• Sophistication revisited
• Computational depth: Concept and applications
• An almost machine-independent theory of program-length complexity, sophistication, and induction
• Sophistication as Randomness Deficiency
• A Safe Approximation for Kolmogorov Complexity
• Kolmogorov's Structure Functions and Model Selection
• Algorithmic statistics
• On notation for ordinal numbers