Complexity and Randomness Course notes , University of Auckland

@inproceedings{Terwijn2003ComplexityAR,
  title={Complexity and Randomness Course notes , University of Auckland},
  author={Sebastiaan Terwijn},
  year={2003}
}
2 Random finite strings 7 2.1 Plain Kolmogorov complexity . . . . . . . . . . . . . . . . . . 7 2.2 Prefix-free complexity . . . . . . . . . . . . . . . . . . . . . . 8 2.3 Kraft inequality, Shannon-Fano code . . . . . . . . . . . . . . 9 2.4 The universal semimeasure m . . . . . . . . . . . . . . . . . . 10 2.5 A priori probability . . . . . . . . . . . . . . . . . . . . . . . . 11 2.6 Coding, symmetry, and counting . . . . . . . . . . . . . . . . 12 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 49 references

Randomness in computability theory

K. Ambos-Spies, A. Kučera
in: P. Cholak et al., Computability Theory: Current Trends and Open Problems, Contemporary Mathematics 257 • 2000
View 9 Excerpts
Highly Influenced

Constructive dimension equals Kolmogorov complexity

Inf. Process. Lett. • 2005
View 6 Excerpts
Highly Influenced

The Dimensions of Individual Strings and Sequences

Inf. Comput. • 2003
View 10 Excerpts
Highly Influenced

Randomness and Recursive Enumerability

SIAM J. Comput. • 2001
View 4 Excerpts
Highly Influenced

Computability and measure

S. A. Terwijn
PhD thesis, University of Amsterdam/ILLC • 1998
View 11 Excerpts
Highly Influenced

Information and Randomness

Monographs in Theoretical Computer Science An EATCS Series • 1994
View 8 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…