Pages that link to "Item:Q5958279"
From MaRDI portal
The following pages link to Kolmogorov entropy in the context of computability theory (Q5958279):
Displayed 8 items.
- Open problems in universal induction \& intelligence (Q1662486) (← links)
- On the computational power of random strings (Q2271990) (← links)
- On semimeasures predicting Martin-Löf random sequences (Q2381581) (← links)
- What can be efficiently reduced to the Kolmogorov-random strings? (Q2576937) (← links)
- Randomness, Computation and Mathematics (Q2904405) (← links)
- The Complexity of Complexity (Q2973719) (← links)
- Limits on the Computational Power of Random Strings (Q3012814) (← links)
- Approximating Kolmogorov complexity (Q6062178) (← links)