Theodore A. Slaman

Bibliography

MSC 68Q30, Algorithmic information theory (Kolmogorov complexity, etc.) .

1. Kučera, Antonín and Slaman, Theodore A. (2007). Low upper bounds of ideals. preprint. [pdf] [arXiv] [GS][MRef]

2. Reimann, Jan and Slaman, Theodore A. (2007). Probability Measures and Effective Randomness. preprint. [pdf] [arXiv] [GS][MRef]

3. Merkle, Wolfgang and Mihailovi'c, Nenad and Slaman, Theodore A. (2004). Some results on effective randomness. In Automata, languages and programming Lecture Notes in Comput. Sci. 3142 983--995 Springer Berlin. [pdf] [MR] [GS][MRef]

4. Kučera, Antonín and Slaman, Theodore A. (2001). Randomness and recursive enumerability. SIAM J. Comput. 31 No.1, 199--211 (electronic). [pdf] [MR] [GS][MRef]