Left computably enumerable reals and initial segment complexity
Logic in Computer Science
2022-08-02 v1
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.
Cite
@article{arxiv.2208.00423,
title = {Left computably enumerable reals and initial segment complexity},
author = {George Davie},
journal= {arXiv preprint arXiv:2208.00423},
year = {2022}
}
Comments
13 pages