Two More Characterizations of K-Triviality
暂无分享,去创建一个
Joseph S. Miller | Noam Greenberg | Benoit Monin | Daniel Turetsky | Joseph S. Miller | B. Monin | Noam Greenberg | Daniel Turetsky
[1] André Nies,et al. Using random sets as oracles , 2007 .
[2] A. Kucera. Measure, Π10-classes and complete extensions of PA , 1985 .
[3] Robert W. Robinson,et al. Degrees joining to 0′ , 1981, Journal of Symbolic Logic.
[4] Adam R. Day,et al. Cupping with random sets , 2012, 1206.1603.
[5] Denis R. Hirschfeldt,et al. Algorithmic randomness and complexity. Theory and Applications of Computability , 2012 .
[6] Michiel van Lambalgen,et al. The Axiomatization of Randomness , 1990, J. Symb. Log..
[7] Bjorn Kjos-Hanssen,et al. Low for random reals and positive-measure domination , 2007, 1408.2171.
[8] André Nies,et al. Relativizing Chaitin's Halting Probability , 2005, J. Math. Log..
[9] Liang Yu,et al. Characterizing strong randomness via Martin-Löf randomness , 2012, Ann. Pure Appl. Log..
[10] A. Nies. Lowness properties and randomness , 2005 .
[11] Jan Reimann,et al. Measures and Their Random Reals , 2008 .
[12] Frank Stephan,et al. Cone avoidance and randomness preservation , 2015, Ann. Pure Appl. Log..
[13] Péter Gács,et al. Every Sequence Is Reducible to a Random One , 1986, Inf. Control..
[14] Liang Yu,et al. On initial segment complexity and degrees of randomness , 2008 .
[15] Octogon staff,et al. Open questions , 2001 .
[16] A. Nies. Computability and randomness , 2009 .