The typical Turing degree

DOI10.1112/plms/pdt065zbMath1332.03009arXiv1111.1064OpenAlexW2120390967MaRDI QIDQ2874662

Adam R. Day, George Barmpalias, Andrew E. M. Lewis-Pye

Publication date: 8 August 2014

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

2-random degreemeasure-risking

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Related Items (11)

On the uniform computational content of the Baire category theorem ⋮ Separating weak \(\alpha\)-change and \(\alpha\)-change genericity ⋮ DEGREES OF RANDOMIZED COMPUTABILITY ⋮ Continuous randomness via transformations of 2-random sequences ⋮ ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY ⋮ The Information Content of Typical Reals ⋮ Diagonally non-computable functions and fireworks ⋮ Random numbers as probabilities of machine behavior ⋮ A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE ⋮ Multiple genericity: a new transfinite hierarchy of genericity notions ⋮ Randomness below complete theories of arithmetic

This page was built for publication: The typical Turing degree