scientific article; zbMATH DE number 1543065

zbMATH Open0960.68080MaRDI QIDQ4520520FDOQ4520520

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

Title of this publication is not available (Why is that?)

Recommendations

• Chaitin \(\Omega \) 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

zbMATH Keywords

Chaitin \(\Omega\) number

Mathematics Subject Classification ID

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

Cited In (20)

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

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)