Left computably enumerable reals and initial segment complexity
arXiv:2208.00423
Abstract
We are interested in the computability between left c.e. reals and their initial segments. We show that the quantity plays a crucial role in this and in their completeness. We look in particular at Chaitin's theorem and its relativisation due to Frank Stephan.
13 pages