K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM

DOI10.1142/9789814360548_0003zbMath1296.03022OpenAlexW2026465389MaRDI QIDQ4922659

George Barmpalias, Noam Greenberg, Antonio Montalbán, Theodore A. Slaman

Publication date: 3 June 2013

Published in: Proceedings of the 11th Asian Logic Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789814360548_0003

zbMATH Keywords

algorithmic randomness\(K\)-trivialitycontinuously random

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Related Items (5)

Continuous randomness via transformations of 2-random sequences ⋮ Schnorr randomness for noncomputable measures ⋮ Turing degrees and randomness for continuous measures ⋮ On effectively closed sets of effective strong measure zero ⋮ Randomness for computable measures and initial segment complexity

This page was built for publication: K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM