Adam R. Day

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	ITERATED PRIORITY ARGUMENTS IN DESCRIPTIVE SET THEORY	2024	Adam R. Day Noam Greenberg Matthew Harrison-Trainor Dan Turetsky
+ PDF Chat	Three topological reducibilities for discontinuous functions	2022	Adam R. Day Rod Downey Linda Brown Westrick
+	Exploratory analysis of text duplication in peer-review reveals peer-review fraud and paper mills	2022	Adam R. Day
+	An Effective Classification of Borel Wadge Classes	2022	Adam R. Day Noam Greenberg Matthew Harrison‐Trainor Dan Turetsky
+	Iterated Priority Arguments in Descriptive Set Theory	2022	Adam R. Day Noam Greenberg Matthew Harrison‐Trainor Dan Turetsky
+	On a question of Slaman and Steel	2020	Adam R. Day Andrew Marks
+	Three topological reducibilities for discontinuous functions	2019	Adam R. Day Rod Downey Linda Brown Westrick
+ PDF Chat	JUMP OPERATIONS FOR BOREL GRAPHS	2018	Adam R. Day Andrew Marks
+	Algorithmic Randomness For Amenable Groups	2018	Adam R. Day
+	MATH442: Mathematics: Functional Analysis	2017	Adam R. Day
+	Notes on Computable Analysis	2016	Michelle Porter Adam R. Day Rodney G. Downey
+ PDF Chat	ON THE STRENGTH OF TWO RECURRENCE THEOREMS	2016	Adam R. Day
+ PDF Chat	Density, forcing, and the covering problem	2015	Adam R. Day Joseph S. Miller
+	Cupping with random sets	2014	Adam R. Day Joseph S. Miller
+	COMPUTING<i>K</i>-TRIVIAL SETS BY INCOMPLETE RANDOM SETS	2014	Laurent Bienvenu Adam R. Day Noam Greenberg Antonín Kučera Joseph S. Miller André Nies Dan Turetsky
+ PDF Chat	Independence, Relative Randomness, and PA Degrees	2014	Adam R. Day Jan Reimann
+	The typical Turing degree	2013	George Barmpalias Adam R. Day Andy Lewis-Pye
+ PDF Chat	Limits to joining with generics and randoms	2013	Adam R. Day Damir D. Dzhafarov
+	On The Strength of Two Recurrence Theorems	2013	Adam R. Day
+	Density, forcing, and the covering problem	2013	Adam R. Day Joseph S. Miller
+	Indifferent sets for genericity	2013	Adam R. Day
+ PDF Chat	Randomness for non-computable measures	2013	Adam R. Day Joseph S. Miller
+	Computing K-Trivial Sets by Incomplete Random Sets	2013	Laurent Bienvenu Adam R. Day Noam Greenberg Antonín Kučera Joseph S. Miller André Nies Dan Turetsky
+	Density, forcing, and the covering problem	2013	Adam R. Day Joseph S. Miller
+	On The Strength of Two Recurrence Theorems	2013	Adam R. Day
+ PDF Chat	From bi-immunity to absolute undecidability	2012	Laurent Bienvenu Rupert Hölzl Adam R. Day
+	Limits to joining with generics and randoms	2012	Adam R. Day Damir D. Dzhafarov
+	Cupping with random sets	2012	Adam R. Day Joseph S. Miller
+	Process and truth-table characterisations of randomness	2012	Adam R. Day
+	Limits to joining with generics and randoms	2012	Adam R. Day Damir D. Dzhafarov
+	From Bi-immunity to Absolute Undecidability	2012	Laurent Bienvenu Rupert Hölzl Adam R. Day
+	Cupping with random sets	2012	Adam R. Day Joseph S. Miller
+	The typical Turing degree	2011	George Barmpalias Adam R. Day Andrew E. M. Lewis
+	A constructive version of Birkhoffʼs ergodic theorem for Martin-Löf random points	2011	Laurent Bienvenu Adam R. Day Mathieu Hoyrup Ilya Mezhirov Alexander Shen
+	Increasing the gap between descriptional complexity and algorithmic probability	2011	Adam R. Day
+	Randomness and Computability	2011	Adam R. Day
+	Randomness and Computability	2011	Adam R. Day
+	The typical Turing degree	2011	George Barmpalias Adam R. Day Andrew E. M. Lewis
+	The computable Lipschitz degrees of computably enumerable sets are not dense	2010	Adam R. Day
+	A constructive version of Birkhoff's ergodic theorem for Martin-L\"of random points	2010	Laurent Bienvenu Adam R. Day Mathieu Hoyrup Ilya Mezhirov Alexander Shen
+	Ergodic-Type Characterizations of Algorithmic Randomness	2010	Laurent Bienvenu Adam R. Day Ilya Mezhirov Alexander Shen
+	On Process Complexity.	2010	Adam R. Day
+	A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points	2010	Laurent Bienvenu Adam R. Day Mathieu Hoyrup Ilya Mezhirov Alexander Shen
+	Increasing the Gap between Descriptional Complexity and Algorithmic Probability	2009	Adam R. Day
+ PDF Chat	From Bi-Immunity to Absolute Undecidability	2009	Laurent Bienvenu Adam R. Day Rupert Hölzl

Common Coauthors

Coauthor	Papers Together
Joseph S. Miller	9
Laurent Bienvenu	9
Noam Greenberg	5
Dan Turetsky	5
Ilya Mezhirov	4
Alexander Shen	4
Mathieu Hoyrup	3
George Barmpalias	3
Damir D. Dzhafarov	3
Matthew Harrison-Trainor	3
Rupert Hölzl	3
Andrew E. M. Lewis	2
Antonín Kučera	2
André Nies	2
Linda Brown Westrick	2
Andrew Marks	2
Rod Downey	2
Michelle Porter	1
Jan Reimann	1
Rodney G. Downey	1
Andy Lewis-Pye	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Using random sets as oracles	2007	Denis R. Hirschfeldt André Nies Frank Stephan	9
+	Lowness properties and randomness	2004	André Nies	6
+	Degrees joining to <b>0</b>′	1981	David B. Posner Robert W. Robinson	6
+ PDF Chat	Uniform test of algorithmic randomness over a general space	2005	Péter Gács	6
+ PDF Chat	Computability of probability measures and Martin-Löf randomness over metric spaces	2009	Mathieu Hoyrup Cristóbal Rojas	5
+	THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS	1970	Alexander K. Zvonkin Leonid A. Levin	5
+ PDF Chat	The Denjoy alternative for computable functions	2012	Laurent Bienvenu Rupert Hölzl Joseph S. Miller André Nies	5
+ PDF Chat	Degrees of unsolvability of continuous functions	2004	Joseph S. Miller	5
+	Degrees of Unsolvability.	1965	T. G. McLaughlin Gerald E. Sacks	5
+	Subsystems of Second Order Arithmetic	1999	Stephen G. Simpson	4
+ PDF Chat	Degrees of monotone complexity	2006	William C. Calhoun	4
+	Ergodic theorems for individual random sequences	1998	Vladimir V. V’yugin	4
+	On the relation between descriptional complexity and algorithmic probability	1983	Péter Gács	4
+	Measures and their random reals	2015	Jan Reimann Theodore A. Slaman	4
+	Randomness and Computability: Open Questions	2006	Joseph S. Miller André Nies	4
+	The definition of random sequences	1966	Per Martin-Löf	4
+ PDF Chat	Effectively closed sets of measures and randomness	2008	Jan Reimann	3
+	Domination, forcing, array nonrecursiveness and relative recursive enumerability	2012	Mingzhong Cai Richard A. Shore	3
+	Random reals and Lipschitz continuity	2006	Andrew E. M. Lewis George Barmpalias	3
+	Degrees of Unsolvability: A Survey of Results	1977	Stephen G. Simpson	3
+	Convergence of Probability Measures	1969	J. F. C. Kingmán P. Billingsley	3
+	On relative randomness	1993	Antonín Kučera	3
+	An Introduction to Kolmogorov Complexity and Its Applications	2019	Ming Li Paul Vitányi	3
+	Weak recursive degrees and a problem of Spector	1999	Shamil Ishmukhametov	3
+	A generalization of Brouwer’s fixed point theorem	1941	Shizuo Kakutani	3
+	The weak truth table degrees of recursively enumerable sets	1975	Richard E. Ladner Leonard P. Sasso	3
+	Effective Convergence in Probability and an Ergodic Theorem forIndividual Random Sequences	1998	Vladimir V. V’yugin	3
+	Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees	2005	George Barmpalias	3
+ PDF Chat	An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals	2010	Kenshi Miyabe	3
+	Randomness and reducibility	2003	Rod Downey Denis R. Hirschfeldt Geoff LaForte	3
+	Measure, Π 1 0 -classes and complete extensions of PA	1985	Antonín Kučera	3
+	Computability Results Used in Differential Geometry	2006	Barbara F. Csima Robert I. Soare	3
+	Kolmogorov entropy in the context of computability theory	2002	Andrej Muchnik Semen Ye. Positselsky	2
+	Cupping with random sets	2014	Adam R. Day Joseph S. Miller	2
+	Generic degrees are complemented	1993	Masahiro Kumabe	2
+	A Survey of the Theory of Random Sequences	1977	C. P. Schnorr	2
+	Every n-generic degree is a minimal cover of an n-generic degree	1993	Masahiro Kumabe	2
+	Probability Measures and Effective Randomness	2007	Jan Reimann Theodore A. Slaman	2
+ PDF Chat	Demuth’s Path to Randomness	2012	Antonín Kučera André Nies	2
+ PDF Chat	On initial segment complexity and degrees of randomness	2008	Joseph S. Miller Liang Yu	2
+	Borel Chromatic Numbers	1999	Alexander S. Kechris Sławomir Solecki Stevo Todorčević	2
+	Generalized high degrees have the complementation property	2004	Noam Greenberg Antonio Montalbán Richard A. Shore	2
+ PDF Chat	A combinatorial proof of the Dense Hindman’s Theorem	2011	Henry Towsner	2
+	Degrees which do not bound minimal degrees	1986	Manuel Lerman	2
+	A Weakly 2-Random Set That Is Not Generalized Low	2007	Andrew D. Lewis Antonio Montalbán André Nies	2
+	On the relation between descriptional complexity and algorithmic probability	1981	Péter Gács	2
+	Measure and minimal degrees	1977	J. B. Paris	2
+ PDF Chat	Measure and cupping in the Turing degrees	2012	George Barmpalias Andrew E. M. Lewis	2
+	Relative Recursive Enumerability of Generic Degrees	1991	Masahiro Kumabe	2
+	Degrees of random sets	1991	Steven M. Kautz	2