scientific article; zbMATH DE number 5252382

MaRDI QIDQ5448294zbMATH OpenFDO

Authors Charles H. Bennett

Publication date 20 March 2008

Mathematics Subject Classification ID

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

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

(7)

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

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)