The typical Turing degree

George Barmpalias, Adam R. Day, Andy Lewis-Pye

Type: Article

Publication Date: 2013-12-15

Citations: 17

DOI: https://doi.org/10.1112/plms/pdt065

Similar Works

Action	Title	Year	Authors
+ PDF Chat	The Mathematical Association of America	1916
+	Bulletin of the London Mathematical Society	2017
+ PDF Chat	The Chauvenet Prize for Mathematical Exposition	1948
+ PDF Chat	The Chauvenet Prize for Mathematical Exposition	1948
+ PDF Chat	The London Mathematical Society 1	1916
+	The Liverpool Mathematical Society	1954	Edward Watson
+	The Liverpool Mathematical Society	1951
+	The Liverpool Mathematical Society	1961
+ PDF Chat	The Mathematical Association	1965
+	The Mathematical Association	1966
+	The Mathematical Association	1937
+ PDF Chat	The Mathematical Association	1952
+	The Mathematical Association	1960
+	The Mathematical Association	1964
+	The Mathematical Association	1959
+	The Mathematical Association	1961
+	The Mathematical Association	1923	T. L. Heath
+	The Mathematical Association	1920	E. T. Whittaker
+	The Mathematical Association	1955
+	The Mathematical Association	2016

Action	Title	Year	Authors
+	The Information Content of Typical Reals	2015	George Barmpalias Andy Lewis-Pye
+	Diagonally non-computable functions and fireworks	2014	Laurent Bienvenu Ludovic Patey
+	Diagonally non-computable functions and fireworks	2016	Laurent Bienvenu Ludovic Patey
+ PDF Chat	Randomness Below Complete Theories of Arithmetic	2022	George Barmpalias Wei Wang
+	A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE	2019	Rodney G. Downey Satyadev Nandakumar
+ PDF Chat	THE TURING DEGREES BELOW GENERICS AND RANDOMS	2014	Richard A. Shore
+ PDF Chat	DEGREES OF RANDOMIZED COMPUTABILITY	2021	Rupert Hölzl Christopher P. Porter
+ PDF Chat	ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY	2019	Laurent Bienvenu Christopher R. Porter
+ PDF Chat	Randomness below complete theories of arithmetic	2022	George Barmpalias Wei Wang
+	Degrees of Randomized Computability	2019	Rupert Hölzl Christopher P. Porter

Action	Title	Year	Authors
+	A Weakly 2-Random Set That Is Not Generalized Low	2007	Andrew D. Lewis Antonio Montalbán André Nies
+ PDF Chat	Definability in the Turing degrees	1986	Theodore A. Slaman W. Hugh Woodin
+	Degrees of random sets	1991	Steven M. Kautz
+	Extensions of embeddings below computably enumerable degrees	2012	Rod Downey Noam Greenberg Andrew D. Lewis Antonio Montalbán
+	A note on the join property	2011	Andrew E. M. Lewis
+	On relative randomness	1993	Antonín Kučera
+	Can you take Solovay’s inaccessible away?	1984	Saharon Shelah
+	Relative Recursive Enumerability of Generic Degrees	1991	Masahiro Kumabe
+	Using random sets as oracles	2007	Denis R. Hirschfeldt André Nies Frank Stephan
+	Arithmetical Sacks Forcing	2006	Rod Downey Liang Yu