Advertisement

Complexity of Computably Enumerable Sets

  • Rodney G. Downey
  • Denis R. Hirschfeldt
Chapter
Part of the Theory and Applications of Computability book series (THEOAPPLCOM)

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].

Keywords

Process 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.School of Mathematics, Statistics and Operations ResearchVictoria University of WellingtonWellingtonNew Zealand
  2. 2.Department of MathematicsUniversity of ChicagoChicagoUSA

Personalised recommendations