scientific article; zbMATH DE number 1543065

MaRDI QIDQ4520520zbMATH OpenFDO

Authors André Nies, Cristian S. Calude

Publication date 26 February 2001

Full work available at URL http://www.jucs.org/jucs_3_11/chaitin_omega_numbers_and

zbMATH Keywords

Chaitin \(\Omega\) number

Mathematics Subject Classification ID

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

Recommendations

• Chaitin numbers and halting problems
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• scientific article; zbMATH DE number 1136091
• Analogues of Chaitin's Omega in the computably enumerable sets
• Computing a Glimpse of Randomness

Cited in

(20)

• Chaitin numbers, Solovay machines, and Gödel incompleteness.
• Presentations of computably enumerable reals.
• Randomness and reducibility
• Analogues of Chaitin's Omega in the computably enumerable sets
• Bi-immunity over different size alphabets
• Things that can be made into themselves
• Relativized depth
• Phase transition between unidirectionality and bidirectionality
• A Note on the Differences of Computably Enumerable Reals
• Algorithmic information theory and its statistical mechanical interpretation
• Chaitin numbers and halting problems
• Trivial Reals
• Covering the recursive sets
• An incomplete set of shortest descriptions
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• A characterization of c. e. random reals
• Computing halting probabilities from other halting probabilities
• Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
• Randomness and universal machines
• Strong Chang's conjecture and the tree property at \(\omega_{2}\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520520)