Adam R. Day

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Iterated priority arguments in descriptive set theory	2024-11-12	Paper
Iterated Priority Arguments in Descriptive Set Theory	2022-11-15	Paper
An Effective Classification of Borel Wadge Classes	2022-11-15	Paper
Three topological reducibilities for discontinuous functions	2022-10-28	Paper
On a question of Slaman and Steel	2020-03-31	Paper
JUMP OPERATIONS FOR BOREL GRAPHS	2018-05-02	Paper
Algorithmic Randomness For Amenable Groups	2018-02-11	Paper
Limits to joining with generics and randoms	2017-05-31	Paper
ON THE STRENGTH OF TWO RECURRENCE THEOREMS	2017-04-28	Paper
Notes on computable analysis	2017-03-31	Paper
Density, forcing, and the covering problem	2015-07-28	Paper
Computuing \(K\)-trivial sets by incomplete random sets	2014-10-21	Paper
Cupping with random sets	2014-09-12	Paper
The typical Turing degree	2014-08-08	Paper
https://portal.mardi4nfdi.de/entity/Q5414578	2014-05-06	Paper
From Bi-Immunity to Absolute Undecidability	2014-04-04	Paper
Independence, relative randomness, and PA degrees	2014-04-04	Paper
Randomness for non-computable measures	2013-09-04	Paper
Indifferent sets for genericity	2013-04-23	Paper
Process and truth-table characterisations of randomness	2012-10-11	Paper
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points	2012-05-24	Paper
Increasing the gap between descriptional complexity and algorithmic probability	2011-10-17	Paper
The computable Lipschitz degrees of computably enumerable sets are not dense	2011-08-26	Paper
Ergodic-Type Characterizations of Algorithmic Randomness	2010-07-29	Paper
On the computational power of random strings	2009-08-05	Paper
An algorithm for computing the effective linear elastic properties of heterogeneous materials: three-dimensional results for composites with equal phase Poisson ratios	1998-01-27	Paper

Research outcomes over time

This page was built for person: Adam R. Day