A highly random number

MaRDI QIDQ2752143zbMATH OpenFDO

Authors Verónica Becher, Sergio Daicz, Gregory J. Chaitin

Publication date 21 October 2001

zbMATH Keywords

circular maschine

Mathematics Subject Classification ID

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

Recommendations

• Random numbers as probabilities of machine behavior
• Randomness and halting probabilities
• scientific article; zbMATH DE number 1886067
• RELATIVIZING CHAITIN'S HALTING PROBABILITY
• The Kolmogorov complexity of random reals

Cited in

(9)

• Kolmogorov complexity for possibly infinite computations
• Random reals as measures of natural open sets
• Differences of halting probabilities
• Randomness and uniform distribution modulo one
• Turing's normal numbers: towards randomness
• \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets
• scientific article; zbMATH DE number 1886067 (Why is no real title available?)
• Random numbers as probabilities of machine behavior
• Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets

This page was built for publication: A highly random number

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