Adaptive multi-head finite-state gamblers
From MaRDI portal
Cites work
- k + 1 Heads Are Better than k
- Algorithmic randomness and complexity.
- An introduction to Kolmogorov complexity and its applications
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- Dimension in Complexity Classes
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Finite-state dimension
- Finite-state independence
- Multi-head finite automata: characterizations, concepts and open problems
- The definition of random sequences
- The dimensions of individual strings and sequences
- Tight hierarchy of data-independent multi-head automata
This page was built for publication: Adaptive multi-head finite-state gamblers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411966)