2000 character limit reached
Left computably enumerable reals and initial segment complexity
Published 31 Jul 2022 in cs.LO | (2208.00423v1)
Abstract: We are interested in the computability between left c.e. reals $\alpha$ and their initial segments. We show that the quantity $C(C(\alpha_n)|\alpha_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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.