Recursively Enumerable Reals and Chaitin Ω Numbers

by Cristian S. Calude , Peter H. Hertling , Bakhadyr Khoussainov , Yongge Wang
Citations:35 - 3 self

Documents Related by Co-Citation

332 A Theory of Program Size Formally Identical to Information Theory – Gregory J. Chaitin - 1975
325 Algorithmic information theory – G. J. Chaitin - 1977
68 Randomness and Recursive Enumerability – Theodore A. Slaman
1724 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
481 Recursively enumerable sets and degrees – Robert I Soare - 1987
337 The definition of random sequences – Per Martin-Löf - 1966
160 Algorithmic Randomness and Complexity – Rod G Downey, Denis Hirschfeldt - 2010
1198 On computable numbers, with an application to the Entscheidungsproblem – A Turing - 1937
845 Theory of recursive functions and effective computability – Hartley Rogers - 1967