Adam R. Day

Publication Activity (10 Years)

Years Active: 2009-2018
Publications (10 Years): 2

Top Topics

Probabilistic Planning

Uniformly Distributed

Top Venues

Bull. Symb. Log.

Notre Dame J. Formal Log.

Publications

Adam R. Day, Andrew S. Marks
Jump Operations for Borel graphs. J. Symb. Log. 83 (1) (2018)
Adam R. Day
On the strength of two Recurrence theorems. J. Symb. Log. 81 (4) (2016)
Adam R. Day, Jan Reimann
Independence, Relative Randomness, and PA Degrees. Notre Dame J. Formal Log. 55 (1) (2014)
Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky
Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. 20 (1) (2014)
Laurent Bienvenu, Adam R. Day, Rupert Hölzl
From bi-immunity to absolute undecidability. J. Symb. Log. 78 (4) (2013)
Adam R. Day
Indifferent sets for genericity. J. Symb. Log. 78 (1) (2013)
Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. Inf. Comput. 210 (2012)
Adam R. Day
Process and truth-table characterisations of randomness. Theor. Comput. Sci. 452 (2012)
Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points CoRR (2010)
Adam R. Day
On Process Complexity. Chic. J. Theor. Comput. Sci. 2010 (2010)
Adam R. Day
The computable Lipschitz degrees of computably enumerable sets are not dense. Ann. Pure Appl. Log. 161 (12) (2010)
Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen
Ergodic-Type Characterizations of Algorithmic Randomness. CiE (2010)
Adam R. Day
On Process Complexity. CATS (2009)
Adam R. Day
On the computational power of random strings. Ann. Pure Appl. Log. 160 (2) (2009)
Adam R. Day
Increasing the Gap between Descriptional Complexity and Algorithmic Probability. Computational Complexity Conference (2009)