On the Reals Which Cannot Be Random
From MaRDI portal
Publication:2970982
DOI10.1007/978-3-319-50062-1_36zbMATH Open1485.03167OpenAlexW2559696983MaRDI QIDQ2970982FDOQ2970982
Authors: Liang Yu, Yizheng Zhu 
Publication date: 4 April 2017
Published in: Computability and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_36
Recommendations
- scientific article; zbMATH DE number 2204767
- Incompleteness theorems for random reals
- scientific article; zbMATH DE number 3943806
- Relative randomness and real closed fields
- A characterization of c. e. random reals
- Partial Randomness and Dimension of Recursively Enumerable Reals
- Perfect sets of random reals
- Random semicomputable reals revisited
- Random reals and possibly infinite computations Part I: Randomness in ∅′
- No random reals in countable support iterations
Algorithmic randomness and dimension (03D32) Inner models, including constructibility, ordinal definability, and core models (03E45) Determinacy principles (03E60)
Cites Work
- Algorithmic randomness and complexity.
- Title not available (Why is that?)
- A model of set-theory in which every set of reals is Lebesgue measurable
- Set Theory
- Title not available (Why is that?)
- An outline of inner model theory
- Descriptive set theory
- Inner models with many Woodin cardinals
- Title not available (Why is that?)
- \(K\) without the measurable
- Demuth's path to randomness
- Measures and their random reals
- Projectively well-ordered inner models
- The maximality of the core model
- The Theory of Countable Analytical Sets
- Minimal Covers and Hyperdegrees
- Recursion theory. Computational aspects of definability
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: On the Reals Which Cannot Be Random
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970982)
