Complexity of Computably Enumerable Sets
Part of the Theory and Applications of Computability book series (THEOAPPLCOM)
In this section, we look at the initial segment complexity of c.e. sets, including a fascinating gap phenomenon uncovered by Kummer . We begin with an old result of Barzdins .
KeywordsProcess Machine Truth Table Winning Strategy Triangular Array Clopen Subset
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer Science+Business Media, LLC 2010