Pages that link to "Item:Q2638781"
From MaRDI portal
The following pages link to An almost machine-independent theory of program-length complexity, sophistication, and induction (Q2638781):
Displaying 11 items.
- Finite state incompressible infinite sequences (Q259039) (← links)
- Sophistication vs logical depth (Q519900) (← links)
- Sophistication revisited (Q841628) (← links)
- The cellular computer DNA: Program or data (Q912788) (← links)
- Information measures for infinite sequences (Q974755) (← links)
- A comparative classification of complexity measures (Q1321736) (← links)
- Two Problems for Sophistication (Q2835644) (← links)
- Algorithmic Statistics: Forty Years Later (Q2970987) (← links)
- Complexity and meaning in nonlinear dynamical systems (Q4391001) (← links)
- Predictability: a way to characterize complexity (Q5949629) (← links)
- Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics) (Q6153527) (← links)
