Adam R. Day

According to our database, Adam R. Day authored at least 15 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Iterated Priority Arguments in Descriptive Set Theory.

Adam R. Day, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky

Bull. Symb. Log., 2024

2018

Jump Operations for Borel graphs.

Adam R. Day, Andrew S. Marks

J. Symb. Log., 2018

2017

Notes on Computable Analysis.

Michelle Porter, Adam R. Day, Rodney G. Downey

Theory Comput. Syst., 2017

2016

On the strength of two Recurrence theorems.

Adam R. Day

J. Symb. Log., 2016

2014

Independence, Relative Randomness, and PA Degrees.

Adam R. Day, Jan Reimann

Notre Dame J. Formal Log., 2014

Computing k-Trivial Sets by Incomplete Random Sets.

Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky

Bull. Symb. Log., 2014

2013

Indifferent sets for genericity.

Adam R. Day

J. Symb. Log., 2013

From bi-immunity to absolute undecidability.

Laurent Bienvenu, Adam R. Day, Rupert Hölzl

J. Symb. Log., 2013

2012

Process and truth-table characterisations of randomness.

Adam R. Day

Theor. Comput. Sci., 2012

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

Inf. Comput., 2012

2010

On Process Complexity.

Adam R. Day

Chic. J. Theor. Comput. Sci., 2010

The computable Lipschitz degrees of computably enumerable sets are not dense.

Adam R. Day

Ann. Pure Appl. Log., 2010

Ergodic-Type Characterizations of Algorithmic Randomness.

Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009

On the computational power of random strings.

Adam R. Day

Ann. Pure Appl. Log., 2009

Increasing the Gap between Descriptional Complexity and Algorithmic Probability.

Adam R. Day

Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009