A characterization of c. e. random reals

DOI10.1016/S0304-3975(01)00027-5zbMath0992.68080WikidataQ57001698 ScholiaQ57001698MaRDI QIDQ5958278

Cristian S. Calude

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

c.e. realChaitin realrandom real

Mathematics Subject Classification ID

Related Items (8)

Randomness and reducibility ⋮ EXACT APPROXIMATIONS OF OMEGA NUMBERS ⋮ On the hierarchy and extension of monotonically computable real numbers. ⋮ The ibT degrees of computably enumerable sets are not dense ⋮ Computing a Glimpse of Randomness ⋮ Kolmogorov-Loveland randomness and stochasticity ⋮ Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. ⋮ Divergence bounded computable real numbers

Cites Work

• A Theory of Program Size Formally Identical to Information Theory
• Algorithmic Information Theory
• The definition of random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of c. e. random reals