Algorithmic Randomness
From MaRDI portal
Publication:4961126
DOI10.1017/9781108781718OpenAlexW4234113909MaRDI QIDQ4961126
No author found.
Publication date: 21 April 2020
Full work available at URL: https://doi.org/10.1017/9781108781718
Collections of articles of miscellaneous specific interest (00B15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Algorithmic randomness and dimension (03D32)
Related Items (8)
Randomness extraction in computability theory ⋮ Computability of convergence rates in the ergodic theorem for Martin-Löf random points ⋮ The Intersection of Algorithmically Random Closed Sets and Effective Dimension ⋮ Randomness and uniform distribution modulo one ⋮ Continuous randomness via transformations of 2-random sequences ⋮ A Theory of Bounded Inductive Rationality ⋮ Extraction rates of random continuous functionals ⋮ A Church-Turing thesis for randomness?
This page was built for publication: Algorithmic Randomness
