Two Problems for Sophistication
From MaRDI portal
Publication:2835644
Recommendations
Cites work
- scientific article; zbMATH DE number 3860059 (Why is no real title available?)
- scientific article; zbMATH DE number 107774 (Why is no real title available?)
- scientific article; zbMATH DE number 1979532 (Why is no real title available?)
- scientific article; zbMATH DE number 2116058 (Why is no real title available?)
- A safe approximation for Kolmogorov complexity
- Algorithmic statistics
- An almost machine-independent theory of program-length complexity, sophistication, and induction
- Computational depth: Concept and applications
- Information measures, effective complexity, and total information
- Kolmogorov's Structure Functions and Model Selection
- On notation for ordinal numbers
- Sophistication as randomness deficiency
- Sophistication revisited
- Sophistication vs logical depth
Cited in
(7)
This page was built for publication: Two Problems for Sophistication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835644)