Increasing the Gap between Descriptional Complexity and Algorithmic Probability. - Adam R. Day (CCC, 2009)

On the computational power of random strings. - Adam R. Day (Ann. Pure Appl. Log., 2009)

Ergodic-Type Characterizations of Algorithmic Randomness. - Laurent Bienvenu; Adam R. Day; Ilya Mezhirov; Alexander Shen 001 (CiE, 2010)

The computable Lipschitz degrees of computably enumerable sets are not dense. - Adam R. Day (Ann. Pure Appl. Log., 2010)

On Process Complexity. - Adam R. Day (Chic. J. Theor. Comput. Sci., 2010)

A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. - Laurent Bienvenu; Adam R. Day; Mathieu Hoyrup; Ilya Mezhirov; Alexander Shen 001 (Inf. Comput., 2012)

Process and truth-table characterisations of randomness. - Adam R. Day (Theor. Comput. Sci., 2012)

From bi-immunity to absolute undecidability. - Laurent Bienvenu; Adam R. Day; Rupert Hölzl 001 (J. Symb. Log., 2013)

Indifferent sets for genericity. - Adam R. Day (J. Symb. Log., 2013)

Computing k-Trivial Sets by Incomplete Random Sets. - Laurent Bienvenu; Adam R. Day; Noam Greenberg; Antonín Kucera 002; Joseph S. Miller; André Nies; Dan Turetsky (Bull. Symb. Log., 2014)

Independence, Relative Randomness, and PA Degrees. - Adam R. Day; Jan Reimann 001 (Notre Dame J. Formal Log., 2014)

On the strength of two Recurrence theorems. - Adam R. Day (J. Symb. Log., 2016)

Notes on Computable Analysis. - Michelle Porter; Adam R. Day; Rodney G. Downey (Theory Comput. Syst., 2017)

Jump Operations for Borel graphs. - Adam R. Day; Andrew S. Marks (J. Symb. Log., 2018)

Iterated Priority Arguments in Descriptive Set Theory. - Adam R. Day; Noam Greenberg; Matthew Harrison-Trainor; Dan Turetsky (Bull. Symb. Log., 2024)