George Davie

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2022 J jnl
Computability of convergence rates in the ergodic theorem for Martin-Löf random points.
J. Log. Anal.
George Davie
2022 J jnl
Left computably enumerable reals and initial segment complexity.
CoRR
George Davie
2018 J jnl
Weihrauch-completeness for layerwise computability.
Log. Methods Comput. Sci.
Arno Pauly, Willem L. Fouché, George Davie
2015 J jnl
Weihrauch-completeness for layerwise computability.
CoRR
Arno Pauly, George Davie, Willem L. Fouché
2014 J jnl
Fourier spectra of measures associated with algorithmically random Brownian motion.
Log. Methods Comput. Sci.
Willem L. Fouché, Safari Mukeru, George Davie
2013 J jnl
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic.
Chic. J. Theor. Comput. Sci.
Eric Allender, George Davie, Luke Friedman, Samuel B. Hopkins, Iddo Tzameret
2013 J jnl
On the computability of a construction of Brownian motion.
Math. Struct. Comput. Sci.
George Davie, Willem L. Fouché
2012 J jnl
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic.
Electron. Colloquium Comput. Complex.
Eric Allender, George Davie, Luke Friedman, Samuel B. Hopkins, Iddo Tzameret
2004 J jnl
Characterising the Martin-Löf random sequences using computably enumerable sets of measure one.
Inf. Process. Lett.
George Davie
2002 J jnl
Kolmogorov Complexity and Noncomputability.
Math. Log. Q.
George Davie
2001 J jnl
Recursive events in random sequences.
Arch. Math. Log.
George Davie