Pages that link to "Item:Q2904462"
From MaRDI portal
The following pages link to Game Arguments in Computability Theory and Algorithmic Information Theory (Q2904462):
Displaying 9 items.
- Algorithmic minimal sufficient statistics: a new approach (Q285518) (← links)
- Expository notes on computability and complexity in (arithmetical) games (Q1391661) (← links)
- Short lists with short programs in short time (Q1745959) (← links)
- Topological arguments for Kolmogorov complexity (Q2354581) (← links)
- Some properties of antistochastic strings (Q2411042) (← links)
- On approximate decidability of minimal programs (Q2828213) (← links)
- Algorithmic Statistics: Normal Objects and Universal Models (Q5740192) (← links)
- Branching time, perfect information games, and backward induction (Q5954142) (← links)
- The Kolmogorov birthday paradox (Q6104350) (← links)