Adam R. Day - RankMe

18 papers A 1C 1Journal 14Unranked 1

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Iterated Priority Arguments in Descriptive Set Theory. Bull. Symb. Log. Adam R. Day, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky
2018	J	`jnl`	Jump Operations for Borel graphs. J. Symb. Log. Adam R. Day, Andrew S. Marks
2017	—	`ed.`	Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday Computability and Complexity Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond
2017	J	`jnl`	Notes on Computable Analysis. Theory Comput. Syst. Michelle Porter, Adam R. Day, Rodney G. Downey
2016	J	`jnl`	On the strength of two Recurrence theorems. J. Symb. Log. Adam R. Day
2014	J	`jnl`	Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky
2014	J	`jnl`	Independence, Relative Randomness, and PA Degrees. Notre Dame J. Formal Log. Adam R. Day, Jan Reimann
2013	J	`jnl`	From bi-immunity to absolute undecidability. J. Symb. Log. Laurent Bienvenu, Adam R. Day, Rupert Hölzl
2013	J	`jnl`	Indifferent sets for genericity. J. Symb. Log. Adam R. Day
2012	J	`jnl`	A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. Inf. Comput. Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
2012	J	`jnl`	Process and truth-table characterisations of randomness. Theor. Comput. Sci. Adam R. Day
2010	J	`jnl`	A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points CoRR Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
2010	C	`conf`	Ergodic-Type Characterizations of Algorithmic Randomness. CiE Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen
2010	J	`jnl`	On Process Complexity. Chic. J. Theor. Comput. Sci. Adam R. Day
2010	J	`jnl`	The computable Lipschitz degrees of computably enumerable sets are not dense. Ann. Pure Appl. Log. Adam R. Day
2009	A	`conf`	Increasing the Gap between Descriptional Complexity and Algorithmic Probability. CCC Adam R. Day
2009	—	`conf`	On Process Complexity. CATS Adam R. Day
2009	J	`jnl`	On the computational power of random strings. Ann. Pure Appl. Log. Adam R. Day