scientific article; zbMATH DE number 5252382

MaRDI QIDQ5448294zbMATH OpenFDO

Authors Charles H. Bennett

Publication date 20 March 2008

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Randomness and arithmetic
• scientific article; zbMATH DE number 7228967
• Numberings and randomness
• scientific article; zbMATH DE number 782022
• scientific article; zbMATH DE number 850631
• On tables of random numbers

Cited in

(8)

• On the relation between descriptional complexity and algorithmic probability
• On randomness, determinism and computability
• Meta math! The quest for omega. Translated from the English by Laurence Decréau
• scientific article; zbMATH DE number 850631 (Why is no real title available?)
• Selva Selvaggia
• Computing a Glimpse of Randomness
• The Omega Number: Irreducible Complexity in Pure Math
• Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega

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 Q5448294)