scientific article; zbMATH DE number 3570424
From MaRDI portal
Publication:4140968
Cited in
(14)- Randomness and reducibility
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Kolmogorov complexity of enumerating finite sets
- EKR sets for large \(n\) and \(r\)
- scientific article; zbMATH DE number 5887472 (Why is no real title available?)
- scientific article; zbMATH DE number 3936061 (Why is no real title available?)
- scientific article; zbMATH DE number 4128143 (Why is no real title available?)
- From Riesz products to random sets
- scientific article; zbMATH DE number 5259850 (Why is no real title available?)
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- How real is incomputability in physics?
- Compression of enumerations and gain
- Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets
- Undecidability of the structure of the Solovay degrees of c.e. reals
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 Q4140968)