Lowness of higher randomness notions
type: Item
instance of: scholarly article
title: Lowness of higher randomness notions
zbMATH Open document ID: 1153.03020
author: André Nies
author: Liang Yu
author: C. T. Chong
published in: Israel Journal of Mathematics
publication date: 2008-10-16T00:00:00Z
Mathematics Subject Classification ID: 03D80
Mathematics Subject Classification ID: 03D65
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 5351772
zbMATH Keywords: algorithmic randomness
zbMATH Keywords: random reals
zbMATH Keywords: higher recursion theory
zbMATH Keywords: Martin-Löf randomness
MaRDI profile type: Publication
full work available at URL: s11856-008-1019-9
OpenAlex ID: W2021939807
cites work: Q5573370
cites work: Some applications of the notions of forcing and generic sets
cites work: Incompleteness along paths in progressions of theories
cites work: Q5537368
cites work: Randomness via effective descriptive set theory
cites work: Measure and category in effective descriptive set theory
cites work: The Theory of Countable Analytical Sets
cites work: Lowness for the Class of Schnorr Random Reals
cites work: Uniformization in a playful universe
cites work: Descriptive set theory
cites work: Computability and Randomness
cites work: Randomness, relativization and Turing degrees
cites work: Measure-Theoretic Uniformity in Recursion Theory and Set Theory
cites work: Q4040890
cites work: Hyperarithmetical quantifiers
cites work: Theory and Applications of Models of Computation
cites work: Q5583851
cites work: Computational randomness and lowness
cites work: Lowness for genericity
DOI: 10.1007/S11856-008-1019-9
description: scientific article; zbMATH DE number 5351772