Left computably enumerable reals and initial segment complexity

07/31/2022

∙

by   George Davie, et al.

∙

0

∙

share

We are interested in the computability between left c.e. reals α and their initial segments. We show that the quantity C(C(α_n)|α_n) 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.