Recursive events in random sequences. - George Davie (Arch. Math. Log., 2001)

Kolmogorov Complexity and Noncomputability. - George Davie (Math. Log. Q., 2002)

Characterising the Martin-Löf random sequences using computably enumerable sets of measure one. - George Davie (Inf. Process. Lett., 2004)

Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. - Eric Allender; George Davie; Luke Friedman; Samuel B. Hopkins 001; Iddo Tzameret (Chic. J. Theor. Comput. Sci., 2013)

On the computability of a construction of Brownian motion. - George Davie; Willem L. Fouché (Math. Struct. Comput. Sci., 2013)

Fourier spectra of measures associated with algorithmically random Brownian motion. - Willem L. Fouché; Safari Mukeru; George Davie (Log. Methods Comput. Sci., 2014)

Weihrauch-completeness for layerwise computability. - Arno Pauly; Willem L. Fouché; George Davie (Log. Methods Comput. Sci., 2018)

Left computably enumerable reals and initial segment complexity. - George Davie (CoRR, 2022)

Computability of convergence rates in the ergodic theorem for Martin-Löf random points. - George Davie (J. Log. Anal., 2022)