Algorithmic Randomness of Closed Sets
From MaRDI portal
Publication:5441120
DOI10.1093/logcom/exm033zbMath1155.03031OpenAlexW2122701041MaRDI QIDQ5441120
Paul Brodhead, Douglas Cenzer, Seyyed Dashti, George Barmpalias, Rebecca Weber
Publication date: 7 February 2008
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exm033
recursion theoryalgorithmic randomnessinfinite treesrandom closed setghost code\(\Pi^0_1\)-classesMartin-Löf random set
Related Items
Energy randomness ⋮ The Intersection of Algorithmically Random Closed Sets and Effective Dimension ⋮ Sub-computable Bounded Pseudorandomness ⋮ Algorithmically Random Functions and Effective Capacities ⋮ Dimension spectra of random subfractals of self-similar fractals ⋮ Layerwise computability and image randomness ⋮ Martin-Löf random generalized Poisson processes ⋮ PA RELATIVE TO AN ENUMERATION ORACLE ⋮ Effective randomness of unions and intersections ⋮ Algorithmic randomness of continuous functions ⋮ Immunity for Closed Sets ⋮ Members of Random Closed Sets ⋮ The random members of a \({\Pi }_{1}^{0}\) class ⋮ Random closed sets viewed as random recursions ⋮ Computable randomness and betting for computable probability spaces ⋮ Martin-Löf randomness and Galton-Watson processes ⋮ MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory
