Algorithmic dimensions via learning functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1670880 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 7378388 (Why is no real title available?)
- scientific article; zbMATH DE number 3034028 (Why is no real title available?)
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS
- A unified approach to the definition of random sequences
- Algorithmic Fractal Dimensions in Geometric Measure Theory
- Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
- Algorithmic randomness and complexity.
- Bounding the dimension of points on a line
- Computability and Randomness
- Dimension in Complexity Classes
- Dimension und äußeres Maß.
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Elements of Information Theory
- Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
- Fractal Intersections and Products via Algorithmic Dimension
- Gales suffice for constructive dimension
- Language identification in the limit
- Recognizing strong random reals
- Systems that learn. An introduction to learning theory for cognitive and computer scientists
- The definition of random sequences
- The dimensions of individual strings and sequences
- The point-to-set principle and the dimensions of Hamel bases
- Two definitions of fractional dimension
- Who asked us? How the theory of computing answers questions about analysis
This page was built for publication: Algorithmic dimensions via learning functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241080)
