scientific article; zbMATH DE number 1136091
From MaRDI portal
Publication:4381402
zbMath0894.68081MaRDI QIDQ4381402
Yongge Wang, Bakhadyr Khoussainov, Peter H. Hertling, Cristian S. Calude
Publication date: 1 April 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Randomness and reducibility ⋮ Random Semicomputable Reals Revisited ⋮ On Kurtz randomness ⋮ What Percentage of Programs Halt? ⋮ The Kolmogorov complexity of random reals ⋮ Simplicity via provability for universal prefix-free Turing machines ⋮ Π11‐Martin‐Löf randomness and Π11‐Solovay completeness ⋮ Random reals à la Chaitin with or without prefix-freeness ⋮ Epistemic horizons and the foundations of quantum mechanics ⋮ Weakly computable real numbers ⋮ Recursively enumerable reals and Chaitin \(\Omega\) numbers ⋮ A characterization of c. e. random reals ⋮ Computing a Glimpse of Randomness ⋮ Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. ⋮ The closure properties on real numbers under limits and computable operators. ⋮ Presentations of computably enumerable reals.
This page was built for publication:
