[1]Barmpalias, George, , vol. 161 (2010), no. 7,
pp. 923–934.

[2]Barmpalias, George, , vol. 5(2011), no. 4,
pp. 609–623.

[3]Barmpalias, George, , vol. 233 (2013), pp.
41–59.

[4]Bienvenu, Laurent and Downey, Rod G., Kolmogorov complexity and Solovay
functions, *STACS* (Albers, Susanne and Marion, Jean-Yves, editors), LIPIcs, vol. 3,
Schloss Dagstuhl - Leibniz-Zentrum fuer
Informatik, Germany,
2009, pp.
147–158.

[5]Barmpalias, George and Lewis, Andrew E.M., , vol. 467 (2011), pp.
2912–2926.

[6]Bienvenu, Laurent, Merkle, Wolfgang, and Nies, André, 9, pp. 452–463,
2011.

[7]Barmpalias, George and Nies, André, , vol. 162 (2011), no. 6,
pp. 465–473.

[8]Chaitin, Gregory J., , vol. 22 (1975), pp.
329–340.

[9]Calude, Christian, Hertling, Peter, Khoussainov, Bakhadyr, and Wang, Yongge, , vol. 255 (2001), no.
(1–2), pp.
125–149.

[10]Downey, Rod G. and Hirshfeldt, Denis, **Algorithmic Randomness and Complexity**, Springer, Berlin 2010.

[11]Downey, Rod G., Hirschfeldt, Denis R., Nies, André, and Stephan, Frank, Trivial reals, **Proceedings of the 7th and 8th Asian Logic
Conferences**, Singapore University
Press, Singapore,
2003, pp.
103–131.

[12]Hölzl, Rupert, Kräling, Thorsten, and Merkle, Wolfgang, , vol. 5734, , 2009, pp.
392–402.

[13]Kolmogorov, Andrey N., , vol. 1 (1965), no. 1,
pp. 3–11.

[14]Kleene, Stephen C. and Post, Emil, , vol. 59 (1954), pp.
379–407.

[15]Antonín Kučera
and Theodore Slaman, , vol. 31 (2001), no. 1,
pp. 199–211.

[16]Antonín Kučera
and Theodore Slaman, , this Journal, vol. 74 (2009),
no. 2, pp.
517–534.

[17]Lachlan, Alistair H., , vol. 16 (1966), pp.
537–569.

[18]Levin, Leonid A., , vol. 212 (1973), pp.
548–550.

[19]Li, Ming and Vitányi, Paul, **An introduction to Kolmogorov complexity and its applications**, second ed., Graduate Texts in
Computer Science, Springer-Verlag, New
York, 1997.

[20]Miller, Joseph S., , vol. 50 (2010), no. 4,
pp. 381–391.

[21]Martin-Löf, Per, , vol. 9 (1966), pp.
602–619.

[22]Miller, Joseph S. and Nies, André, , vol. 12 (2006), no. 3,
pp. 390–410.

[23]Nies, André, , vol. 27,
,
2006, pp.
261–275

[24]Nies, André, , vol. 197 (2005), no. 1,
pp. 274–305.

[25]Nies, André, **Computability and Randomness**, Oxford University Press,
Oxford, 2009.

[26]Odifreddi, Piergiorgio G., **Classical recursion theory, Vol. I**, North-Holland,
Amsterdam,
1989.

[27]Shore, Richard A., , vol. 24 (1981), pp.
1–14.

[28]Solomonoff, Ray J., , vol. 7 (1964), pp.
1–22 and
224–254.

[29]Solovay, Robert, ,
1975, p. 215.

[30]Spector, Clifford, , vol. 64 (1956), pp.
581–592.

[31]Sterkenburg, Tom, ,
2011.

[32]Mike Yates, C.E., A minimal pair of recursively enumerable degrees, this
Journal, vol. 31 (1966), pp.
59–168.