Continuous higher randomness

DOI10.1142/S0219061317500040zbMath1420.03100arXiv1503.04884OpenAlexW2531462202MaRDI QIDQ5268401

Laurent Bienvenu, Noam Greenberg, Benoit Monin

Publication date: 20 June 2017

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.04884

zbMATH Keywords

higher randomness\(K\)-trivialitycollapsing approximationcontinuous relativized

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Algorithmic randomness and dimension (03D32)

Related Items

RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY, HIGHER RANDOMNESS AND GENERICITY, Parallel and Serial Jumps of Weak Weak König’s Lemma, Bad oracles in higher computability and randomness, Effectively closed subgroups of the infinite symmetric group, GENERICITY AND RANDOMNESS WITH ITTMS, Unnamed Item, Measure-theoretic applications of higher Demuth’s Theorem, SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE, A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coherent randomness tests and computing the \(K\)-trivial sets
• Lowness for genericity
• Lowness of higher randomness notions
• Some measure theoretic results in effective descriptive set theory
• Computable structures and the hyperarithmetical hierarchy
• Bad oracles in higher computability and randomness
• Density, forcing, and the covering problem
• Lowness properties and randomness
• RANDOMNESS IN THE HIGHER SETTING
• RELATIVE TO ANY NON-HYPERARITHMETIC SET
• Higher randomness and forcing with closed sets
• Difference randomness
• Algorithmic Randomness and Complexity
• A New Proof of Friedman's Conjecture
• Randomness and differentiability
• Counting the changes of random Δ20 sets
• On initial segment complexity and degrees of randomness
• Von Mises' definition of random sequences reconsidered
• Forcing with tagged trees
• HIGHER RANDOMNESS AND GENERICITY
• Set Theory
• Randomness via effective descriptive set theory
• Using random sets as oracles
• A Weakly 2-Random Set That Is Not Generalized Low
• The definition of random sequences