Pages that link to "Item:Q582861"
From MaRDI portal
The following pages link to Kolmogorov's contributions to information theory and algorithmic complexity (Q582861):
Displaying 17 items.
- Sophistication vs logical depth (Q519900) (← links)
- Entropy measures vs. Kolmogorov complexity (Q657548) (← links)
- Upcrossing inequalities for stationary sequences and applications (Q971935) (← links)
- On a definition of random sequences with respect to conditional probability (Q999259) (← links)
- Non-stochastic infinite and finite sequences (Q1275010) (← links)
- Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers (Q1403411) (← links)
- Does snooping help? (Q1605319) (← links)
- Entropic measures, Markov information sources and complexity (Q1855845) (← links)
- Akaike's information criterion and recent developments in information complexity (Q1977905) (← links)
- Nonlinear extension of bode's integral based on an information-theoretic interpretation (Q2503523) (← links)
- CODING WITH MINIMAL PROGRAMS (Q5249273) (← links)
- Regression and ICOMP—A Simulation Study (Q5481737) (← links)
- TheKolmogorov Legacy in Physics (Q5900117) (← links)
- TheKolmogorov Legacy in Physics (Q5900119) (← links)
- Andrei Kolmogorov and Leonid Levin on Randomness (Q6096248) (← links)
- Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics) (Q6153527) (← links)
- An information theory approach to stock market liquidity (Q6592503) (← links)