The interplay of classes of algorithmically random objects

DOI10.4115/jla.2015.7.7zbMath1452.03095arXiv1503.06322OpenAlexW1753740038MaRDI QIDQ3467669

Quinn Culver, Christopher P. Porter

Publication date: 4 February 2016

Published in: Journal of Logic and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.06322

zbMATH Keywords

computable analysisrandom measuresalgorithmic randomnessrandom closed setsrandom functions

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Algorithmic randomness and dimension (03D32)

Related Items (2)

The Intersection of Algorithmically Random Closed Sets and Effective Dimension ⋮ The random members of a \({\Pi }_{1}^{0}\) class

This page was built for publication: The interplay of classes of algorithmically random objects