The random members of a \({\Pi }_{1}^{0}\) class

DOI10.1007/s00224-017-9824-3zbMath1436.03226arXiv1611.05818OpenAlexW2768545277MaRDI QIDQ1787954

Douglas Cenzer, Christopher P. Porter

Publication date: 5 October 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

Kolmogorov complexitycomputability theoryalgorithmic randomness\({\Pi }_{1}^{0}\) classesnon-uniform probability measures

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (1)

Continuous randomness via transformations of 2-random sequences

Cites Work

• Unnamed Item
• Coherent randomness tests and computing the \(K\)-trivial sets
• Martin-Löf randomness and Galton-Watson processes
• Degrees of difficulty of generalized r.e. separating classes
• Algorithmic randomness of continuous functions
• Effectively closed sets and graphs of computable real functions.
• LEBESGUE DENSITY AND CLASSES
• Randomness for non-computable measures
• Denjoy, Demuth and density
• The interplay of classes of algorithmically random objects
• Members of Random Closed Sets
• Von Mises' definition of random sequences reconsidered
• A quest for algorithmically random infinite structures
• A Quest for Algorithmically Random Infinite Structures, II
• DEEP CLASSES
• Computability and Randomness
• Algorithmic Randomness of Closed Sets
• MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS
• Π₁⁰ classes with complex elements
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The definition of random sequences

This page was built for publication: The random members of a \({\Pi }_{1}^{0}\) class