G. Barmpalias and A. Lewis-pye, Differences of halting probabilities, J. Comput. Syst. Sci, vol.89, pp.349-360, 2017.
DOI : 10.1016/j.jcss.2017.06.002
URL : http://arxiv.org/pdf/1604.00216

S. Boyd and L. Vandenberghe, Convex Optimization, 2004.

V. Brattka and G. Presser, Computability on subsets of metric spaces, Theoretical Computer Science, vol.305, issue.1-3, pp.43-76, 2003.
DOI : 10.1016/s0304-3975(02)00693-x
URL : https://doi.org/10.1016/s0304-3975(02)00693-x

M. Hoyrup, Genericity of weakly computable objects, XX:18 Semicomputable points in Euclidean spaces 5, vol.60, pp.396-420, 2017.
DOI : 10.1007/s00224-016-9737-6
URL : https://hal.archives-ouvertes.fr/hal-01095864

M. Hoyrup, D. N. Saucedo, and D. M. Stull, Semicomputable geometry, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, vol.107, pp.1-129, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01770562

M. Kummer and M. Schäfer, Computability of convex sets, STACS 95, pp.550-561, 1995.
DOI : 10.1007/3-540-59042-0_104

J. S. Miller-;-adam, R. Day, M. R. Fellows, N. Greenberg, B. Khoussainov et al., On work of Barmpalias and Lewis-Pye: A derivation on the D.C.E. reals, Computability and Complexity -Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol.10010, pp.644-659, 2017.

, André Nies. Computability and randomness. Oxford logic guides, 2009.

M. Ziegler, Computability on regular subsets of euclidean space, Mathematical Logic Quarterly, vol.48, issue.S1, pp.157-181, 2002.