Abstract
In this section, we look at the initial segment complexity of c.e. sets, including a fascinating gap phenomenon uncovered by Kummer [226]. We begin with an old result of Barzdins [29].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Downey, R.G., Hirschfeldt, D.R. (2010). Complexity of Computably Enumerable Sets. In: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68441-3_16
Download citation
DOI: https://doi.org/10.1007/978-0-387-68441-3_16
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95567-4
Online ISBN: 978-0-387-68441-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)