skip to content


This page lists the preprints associated with this programme only.
A full list is also available, with details of how to submit relevant papers.

Search preprint archive
Authors Title Attachments
B Löwe; S Tarafder Generalized algebra-valued models of set theory ni14091.pdf
M Garlík Ajtai's completeness theorem for nonstandard finite structures ni13012.pdf
AG Melnikov; A Nies The classification problem for compact computable metric spaces ni13004.pdf
Y Matiyasevich New conjectures about zeroes of Riemann's zeta function ni12088.pdf
A Beckmann; SR Buss; S-D Friedman Safe recursive set functions ni12082.pdf
A Beckmann; SR Buss Improved witnessing and local improvement principles for second-order bounded arithmetic ni12081.pdf
G Barmpalias Algorithmic randomness and measures of complexity ni12073.pdf
G Barmpalias; RG Downey Resolute sequences in initial segment complexity ni12072.pdf
G Barmpalias; A Li Kolmogorov complexity and computably enumerable sets ni12071.pdf
G Barmpalias; R Hölzl; AEM Lewis; W Merkle Analogues of Chaitin's omega in the computably enumerable sets ni12070.pdf
RA Shore The Turing degrees below generics and randoms ni12069.pdf
V Becher Turing's normal numbers: towards randomness ni12068.pdf
V Becher; PA Heiber Normality and differentiability ni12067.pdf
V Becher; S Grigorieff Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization ni12066.pdf
V Becher; PA Heiber Normal numbers and finite automata ni12065.pdf
V Becher; S Grigorieff Wadge hardness in Scott spaces and its effectivization ni12064.pdf
TA Slaman; A Sorbi A note on initial segments of the enumeration degrees ni12063.pdf
R Glaschick A size index for multitape Turing Machines ni12061.pdf
E Mayordomo Effective dimension in some general metric spaces ni12060.pdf
JD Hamkins; B Löwe Moving up and down in the generic multiverse ni12059.pdf
M Lauria; P Pudlák; V Rödl; N Thapen The complexity of proving that a graph is Ramsey ni13005.pdf
JD Hamkins Every countable model of set theory embeds into its own constructible universe ni12056.pdf
JD Hamkins; G Leibman; B Löwe Structural connections between a forcing class and its modal logic ni12055.pdf
AA Abbott; CS Calude; J Conder; K Svozil Kochen-Specker theorem revisited and strong incomputability of quantum randomness ni12053.pdf
JM Hitchcock; E Mayordomo Base invariance of feasible dimension ni12052.pdf
PD Welch Global reflection principles ni12051.pdf
PD Welch $\it G \delta\sigma$-games ni12050.pdf
B Fisseni; B Löwe Which dimensions of narratives are relevent for human judgments of story equivalence? ni12049.pdf
R Bod; B Fisseni; A Kurji; B Löwe Objectivity and reproducibility of proppian narrative annotations ni12048.pdf
R Downey; KM Ng Lowness for bounded randomness ni12047.pdf
EJ Spoors; SS Wainer A hierarchy of ramified theories below PRA ni12046.pdf
R Downey; KM Ng; R Solomon On minimal wtt-degrees and computably enumerable Turing degrees ni12044.pdf
R Downey; A Kach; S Lempp; D Turetsky Computable categoricity versus relative computable categoricity ni12043.pdf
G Barmpalias; R Downey Exact pairs for the ideal of the $\it K$-trivial sequences in the turing degrees ni12042.pdf
R Downey; H Bodlaender; F Fomin; D Marx A basic parameterized complexity primer ni12041.pdf
R Downey The birth and early years of parameterized complexity ni12040.pdf
RG Downey; CG Jockusch Jr.; PE Schupp Asymptotic density and computably enumerable sets ni12039.pdf
R Downey; A Dediu; C Martin-Vide A parameterized complexity tutorial ni12038.pdf
R Downey Randomness, computation and mathematics ni12037.pdf
V Brattka; S Le Roux; A Pauly Connected choice and the Brouwer Fixed Point Theorem ni12036.pdf
University of Cambridge Research Councils UK
    Clay Mathematics Institute The Leverhulme Trust London Mathematical Society Microsoft Research NM Rothschild and Sons