On Sequences with Non-learnable Subsequences
From MaRDI portal
Publication:3503648
DOI10.1007/978-3-540-79709-8_31zbMath1142.68410MaRDI QIDQ3503648
Publication date: 5 June 2008
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79709-8_31
68Q32: Computational learning theory
Related Items
Cites Work
- Unnamed Item
- Calibration-based empirical probability
- Non-stochastic infinite and finite sequences
- Self-Calibrating Priors Do Not Exist
- The Well-Calibrated Bayesian
- Asymptotic calibration
- Any Inspection is Manipulable
- Learning Theory
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- Calibration with Many Checking Rules