ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY

DOI10.1017/JSL.2018.53zbMath1445.03049arXiv1804.09774OpenAlexW4302235711WikidataQ128496812 ScholiaQ128496812MaRDI QIDQ4628689

Christopher P. Porter, Laurent Bienvenu

Publication date: 15 March 2019

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

algorithmic randomnesseffective genericity

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The degrees of bi-hyperhyperimmune sets
• Diagonally non-computable functions and fireworks
• Demuth randomness and computational complexity
• The typical Turing degree
• CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS
• JSL volume 79 issue 2 Cover and Front matter
• Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma
• Jump inversions inside effectively closed sets and applications to randomness
• Difference randomness
• Algorithmic Randomness and Complexity
• Lowness for Demuth Randomness
• Strong jump-traceability and Demuth randomness
• Initial segments of the degrees of unsolvability Part II: minimal degrees
• Randomness, relativization and Turing degrees

This page was built for publication: ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY