Sophistication revisited
From MaRDI portal
Publication:841628
DOI10.1007/s00224-007-9095-5zbMath1175.68209OpenAlexW2914567561MaRDI QIDQ841628
Luís Antunes, Lance J. Fortnow
Publication date: 18 September 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9095-5
Related Items (6)
Effective complexity of stationary process realizations ⋮ Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics) ⋮ Algorithmic Statistics: Forty Years Later ⋮ Sophistication vs logical depth ⋮ Information measures for infinite sequences ⋮ Two Problems for Sophistication
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning to predict non-deterministically generated strings
- Computational depth: Concept and applications
- An almost machine-independent theory of program-length complexity, sophistication, and induction
- Meaningful Information
- Busy beaver sets: Characterizations and applications
- Algorithmic statistics
- Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
- On the Length of Programs for Computing Finite Binary Sequences
- A formal theory of inductive inference. Part I
This page was built for publication: Sophistication revisited
