scientific article; zbMATH DE number 1543065

zbMath0960.68080MaRDI QIDQ4520520

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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Chaitin \(\Omega\) number

Mathematics Subject Classification ID

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

Related Items (17)

Randomness and reducibility ⋮ Phase Transition between Unidirectionality and Bidirectionality ⋮ Randomness and universal machines ⋮ Relativized depth ⋮ A Note on the Differences of Computably Enumerable Reals ⋮ An incomplete set of shortest descriptions ⋮ Algorithmic information theory and its statistical mechanical interpretation ⋮ Covering the recursive sets ⋮ Bi-immunity over different size alphabets ⋮ Trivial Reals ⋮ Things that can be made into themselves ⋮ 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 ⋮ Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. ⋮ Presentations of computably enumerable reals.

This page was built for publication: