Proof that Solovay randomness is equivalent to strong Chaitin randomness

  • Gregory J. Chaitin
Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)

Abstract

In this chapter I’ll show you that Solovay randomness is equivalent to strong Chaitin randomness. Recall that an infinite binary sequence x is strong Chaitin random iff (H(x n ), the complexity of its n-bit prefix x n ) − n goes to infinity as n increases. I’ll break the proof into two parts.

Keywords

Prefix 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2001

Authors and Affiliations

  • Gregory J. Chaitin
    • 1
  1. 1.IBM Research DivisionThomas J. Watson Research CenterHawthorneUSA

Personalised recommendations