On the Reals Which Cannot Be Random
type: Item
instance of: scholarly article
title: On the Reals Which Cannot Be Random
zbMATH Open document ID: 1485.03167
DOI: 10.1007/978-3-319-50062-1_36
author: Liang Yu
author: Yizheng Zhu
published in: Computability and Complexity
publication date: 2017-04-04T00:00:00Z
Mathematics Subject Classification ID: 03D32
Mathematics Subject Classification ID: 03E45
Mathematics Subject Classification ID: 03E60
zbMATH DE Number: 6700082
MaRDI profile type: Publication
full work available at URL: 978-3-319-50062-1 36
OpenAlex ID: W2559696983
cites work: Q4844091
cites work: Recursion theory. Computational aspects of definability
cites work: Algorithmic Randomness and Complexity
cites work: Set Theory
cites work: \(K\) without the measurable
cites work: The Theory of Countable Analytical Sets
cites work: Q3705445
cites work: Demuth's path to randomness
cites work: Q5322161
cites work: Measures and their random reals
cites work: The maximality of the core model
cites work: Minimal Covers and Hyperdegrees
cites work: Q3819052
cites work: A model of set-theory in which every set of reals is Lebesgue measurable
cites work: Inner models with many Woodin cardinals
cites work: Projectively well-ordered inner models
cites work: Q5690487
cites work: An Outline of Inner Model Theory
Recommended article: Q5316387
Recommended article: Incompleteness theorems for random reals
Recommended article: Q3715106
Recommended article: Relative randomness and real closed fields
Recommended article: A characterization of c. e. random reals
Recommended article: Partial Randomness and Dimension of Recursively Enumerable Reals
Recommended article: Perfect sets of random reals
Recommended article: Random Semicomputable Reals Revisited
Recommended article: Random reals and possibly infinite computations Part I: Randomness in ∅′
Recommended article: No random reals in countable support iterations
description: scientific article