Adam R. Day - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2018

Jump Operations for Borel graphsAdam R. Day, Andrew S. Marks. JSYML, 83(1):13-28, 2018. [doi]

2016

On the strength of two Recurrence theoremsAdam R. Day. JSYML, 81(4):1357-1374, 2016. [doi]

2014

Computing k-Trivial Sets by Incomplete Random SetsLaurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera 0002, Joseph S. Miller, André Nies, Dan Turetsky. bsl, 20(1):80-90, 2014. [doi]

Independence, Relative Randomness, and PA DegreesAdam R. Day, Jan Reimann. ndjfl, 55(1):1-10, 2014. [doi]

2013

From bi-immunity to absolute undecidabilityLaurent Bienvenu, Adam R. Day, Rupert Hölzl. JSYML, 78(4):1218-1228, 2013. [doi]

Indifferent sets for genericityAdam R. Day. JSYML, 78(1):113-138, 2013. [doi]

2012

A constructive version of Birkhoff's ergodic theorem for Martin-Löf random pointsLaurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen. iandc, 210:21-30, 2012. [doi]

Process and truth-table characterisations of randomnessAdam R. Day. TCS, 452:47-55, 2012. [doi]

2010

Ergodic-Type Characterizations of Algorithmic RandomnessLaurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen. CiE 2010: 49-58 [doi]

The computable Lipschitz degrees of computably enumerable sets are not denseAdam R. Day. APAL, 161(12):1588-1602, 2010. [doi]

On Process ComplexityAdam R. Day. cjtcs, 2010, 2010. [doi]

2009

Increasing the Gap between Descriptional Complexity and Algorithmic ProbabilityAdam R. Day. coco 2009: 263-273 [doi]

On the computational power of random stringsAdam R. Day. APAL, 160(2):214-228, 2009. [doi]

On Process ComplexityAdam R. Day. cats 2009: 29-34 [doi]

Sign in or sign up to see more results.

runs on WebDSL