scientific article; zbMATH DE number 1136091

MaRDI QIDQ4381402zbMATH OpenFDO

Authors Bakhadyr Khoussainov, Y. Wang, Cristian S. Calude, P. H. Hertling

Publication date 1 April 1998

zbMATH Keywords

universal self-delimiting Turing machine

Mathematics Subject Classification ID

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

Recommendations

• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Randomness and recursive enumerability
• A characterization of c. e. random reals

Cited in

(23)

• A new representation of Chaitin \(\Omega \) number based on compressible strings
• Every computably enumerable random real is provably computably enumerable random
• The Kolmogorov complexity of random reals
• Randomness and recursive enumerability
• Π11‐Martin‐Löf randomness and Π11‐Solovay completeness
• The closure properties on real numbers under limits and computable operators.
• Weakly computable real numbers
• Recursive events in random sequences
• A characterization of c. e. random reals
• Simplicity via provability for universal prefix-free Turing machines
• What percentage of programs halt?
• scientific article; zbMATH DE number 1543065 (Why is no real title available?)
• A c.e. real that cannot be sw-computed by any \(\Omega\) number
• Random semicomputable reals revisited
• Computing a Glimpse of Randomness
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Epistemic horizons and the foundations of quantum mechanics
• Random reals à la Chaitin with or without prefix-freeness
• A Chaitin \(\Omega\) number based on compressible strings
• On Kurtz randomness
• Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness.
• Presentations of computably enumerable reals.
• Randomness and reducibility

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