On the Reals Which Cannot Be Random

DOI10.1007/978-3-319-50062-1_36MaRDI QIDQ2970982zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Inner models, including constructibility, ordinal definability, and core models (03E45) Determinacy principles (03E60)

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

Cites work

• K without the measurable
• A model of set-theory in which every set of reals is Lebesgue measurable
• Algorithmic randomness and complexity.
• An outline of inner model theory
• Demuth's path to randomness
• Descriptive set theory
• scientific article; zbMATH DE number 3930999 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 787541 (Why is no real title available?)
• scientific article; zbMATH DE number 967740 (Why is no real title available?)
• Inner models with many Woodin cardinals
• Measures and their random reals
• Minimal Covers and Hyperdegrees
• Projectively well-ordered inner models
• Recursion theory. Computational aspects of definability
• Set Theory
• The maximality of the core model
• The Theory of Countable Analytical Sets

Cited in

(5)

• No random reals in countable support iterations
• scientific article; zbMATH DE number 3943806 (Why is no real title available?)
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
• Measures and their random reals
• Random reals and possibly infinite computations Part I: Randomness in ∅′

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)