Recursively Enumerable Reals and Chaitin Ω Numbers

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

Documents Related by Co-Citation

333 A Theory of Program Size Formally Identical to Information Theory – Gregory J. Chaitin - 1975
67 Randomness and Recursive Enumerability – Theodore A. Slaman
158 Algorithmic Randomness and Complexity – Rod Downey, Denis Hirshfeldt - 2010
334 The Definition of Random Sequences – Per Martin-Löf - 1966
320 Algorithmic information theory – G. J. Chaitin - 1977
34 A generalization of Chaitin’s halting probability Ω and halting selfsimilar sets – Kohtaro Tadaki - 2002
32 Incompleteness Theorems for Random Reals – G. J. Chaitin - 1987
1689 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
189 The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms – A. K. Zvonkin, L. A. Levin - 1970
53 of a paper (or series of papers) on Chaitin’s work ... done for the most part during the period of Sept – R M Solovay, Draft - 1974
475 Recursively Enumerable Sets and Degrees – R Soare - 1987
13 Degree-Theoretic Aspects of Computably Enumerable Reals – Cristian S. Calude, Cristian S. Calude, Richard Coles, Richard Coles, Peter H. Hertling, Peter H. Hertling, Bakhadyr Khoussainov, Bakhadyr Khoussainov - 1998
25 Some Computability-Theoretical Aspects of Reals and Randomness – Rodney G. Downey - 2001
9 Algorithmic information theory and fractal sets – K Tadaki
232 An Introduction to Computable Analysis – K Weihrauch - 2000
16 Weakly computable real numbers – K Ambos-Spies, K Weihrauch, X Zheng - 2000
30 Recursion theory and Dedekind cuts – R Soare - 1969
1161 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936
48 Information and Randomness – C Calude - 1994