Randomness-Theoretic Weakness

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


In this chapter, we introduce an important class of “randomnesstheoretically weak” sets, the K-trivial sets. As we will see, this class has several natural characterizations, can be used to answer several questions in the theory of algorithmic randomness, and is also of great interest to computability theory.


Cost Function Initial Segment Computable Function Minimal Pair Computable Sequence 
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.

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