Coherent randomness tests and computing the \(K\)-trivial sets

DOI10.4171/JEMS/602zbMath1375.03049OpenAlexW2296409586MaRDI QIDQ277530

André Nies, Noam Greenberg, Laurent Bienvenu, Antonín Kučera, Dan Turetsky

Publication date: 2 May 2016

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/jems/602

zbMATH Keywords

\(K\)-trivial setcoherent randomness

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32)

Related Items (9)

A Computational Approach to the Borwein-Ditor Theorem ⋮ Lightface $$\mathop {\varPi }\nolimits _{3}^{0}$$ Π 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility ⋮ STRONG JUMP-TRACEABILITY ⋮ Computing from projections of random points ⋮ Lowness, Randomness, and Computable Analysis ⋮ Some Questions in Computable Mathematics ⋮ The random members of a \({\Pi }_{1}^{0}\) class ⋮ Highness properties close to PA completeness ⋮ Continuous higher randomness

This page was built for publication: Coherent randomness tests and computing the \(K\)-trivial sets