| Publication | Date of Publication | Type |
|---|
Splitting and jump inversion in the Turing degrees
Computability | 2018-09-20 | Paper |
Linearisations and the Ershov hierarchy
Computability | 2018-09-20 | Paper |
Corrigendum to: ``The d.r.e. degrees are not dense
Annals of Pure and Applied Logic | 2017-09-29 | Paper |
The machine as data: a computational view of emergence and definability
Synthese | 2017-03-09 | Paper |
The machine as data: a computational view of emergence and definability
Synthese | 2017-03-09 | Paper |
Automorphisms of \(\eta\)-like computable linear orderings and Kierstead's conjecture
Mathematical Logic Quarterly | 2017-02-01 | Paper |
A roadmap for TAMC
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Incomputability after Alan Turing
Notices of the American Mathematical Society | 2014-04-15 | Paper |
| Computability theory | 2013-10-04 | Paper |
The mathematician's bias -- and the return to embodied computation
A Computable Universe | 2013-02-26 | Paper |
Introduction to the special issue: Computability of the physical
MSCS. Mathematical Structures in Computer Science | 2012-10-23 | Paper |
Definability in the real universe
(available as arXiv preprint) | 2012-09-05 | Paper |
From Turing machine to morphogenesis: forming and informing computation
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Mathematics, Metaphysics and the Multiverse
Computation, Physics and Beyond | 2012-06-15 | Paper |
| The Incomputable Alan Turing | 2012-06-08 | Paper |
| From Descartes to Turing: the computational content of supervenience | 2012-03-29 | Paper |
Extending and interpreting Post's programme
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees
Theoretical Computer Science | 2011-04-05 | Paper |
Emergence as a computability-theoretic phenomenon
Applied Mathematics and Computation | 2009-11-13 | Paper |
Computation and logic in the real world: CiE 2007
Theory of Computing Systems | 2009-10-19 | Paper |
The Extended Turing Model as Contextual Tool
Lecture Notes in Computer Science | 2009-06-03 | Paper |
On Lachlan's major sub-degree problem
Archive for Mathematical Logic | 2008-09-09 | Paper |
How enumeration reductibility yields extended Harrington non-splitting
Journal of Symbolic Logic | 2008-06-09 | Paper |
The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Post's Programme for the Ershov Hierarchy
Journal Of Logic And Computation | 2008-02-07 | Paper |
The Strongest Nonsplitting Theorem
Lecture Notes in Computer Science | 2007-11-13 | Paper |
There exists a maximal 3-c.e. enumeration degree
Israel Journal of Mathematics | 2007-09-28 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Splitting and cone avoidance in the d.c.e. degrees
Science in China. Series A | 2006-09-22 | Paper |
Definability as hypercomputational effect
Applied Mathematics and Computation | 2006-08-04 | Paper |
| Computability and emergence | 2006-06-29 | Paper |
Bounding and nonbounding minimal pairs in the enumeration degrees
Journal of Symbolic Logic | 2006-01-16 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Properly ?2 minimal degrees and 0? complementation
MLQ | 2005-06-01 | Paper |
The minimal e-degree problem in fragments of Peano arithmetic
Annals of Pure and Applied Logic | 2005-01-31 | Paper |
Turing Definability in the Ershov Hierarchy
Journal of the London Mathematical Society | 2004-06-10 | Paper |
Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable
Journal of Symbolic Logic | 2004-03-01 | Paper |
| scientific article; zbMATH DE number 2039009 (Why is no real title available?) | 2004-02-09 | Paper |
Non-uniformity and generalised Sacks splitting
Acta Mathematica Sinica, English Series | 2003-10-16 | Paper |
On the distribution of Lachlan nonsplitting bases
Archive for Mathematical Logic | 2003-09-16 | Paper |
| scientific article; zbMATH DE number 1955470 (Why is no real title available?) | 2003-07-28 | Paper |
| On a Conjecture of Kleene and Post | 2002-01-21 | Paper |
| scientific article; zbMATH DE number 1523417 (Why is no real title available?) | 2001-03-15 | Paper |
| scientific article; zbMATH DE number 1420839 (Why is no real title available?) | 2000-12-03 | Paper |
| scientific article; zbMATH DE number 1405574 (Why is no real title available?) | 2000-09-20 | Paper |
| scientific article; zbMATH DE number 1390014 (Why is no real title available?) | 2000-09-20 | Paper |
Upper cones as automorphism bases
Siberian Advances in Mathematics | 2000-05-04 | Paper |
Initial segments of recursive linear orders
Order | 1999-03-25 | Paper |
| scientific article; zbMATH DE number 1136098 (Why is no real title available?) | 1999-02-10 | Paper |
| scientific article; zbMATH DE number 1048039 (Why is no real title available?) | 1998-03-31 | Paper |
Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
Annals of Pure and Applied Logic | 1997-11-05 | Paper |
| scientific article; zbMATH DE number 1009727 (Why is no real title available?) | 1997-09-03 | Paper |
Noncappable enumeration degrees below 0e′
Journal of Symbolic Logic | 1997-04-23 | Paper |
Strong Minimal Covers for Recursively Enumerable Degrees
Mathematical Logic Quarterly | 1996-11-04 | Paper |
The discontinuity of splitting in the recursively enumerable degrees
Archive for Mathematical Logic | 1996-07-16 | Paper |
| scientific article; zbMATH DE number 841083 (Why is no real title available?) | 1996-06-10 | Paper |
| scientific article; zbMATH DE number 733392 (Why is no real title available?) | 1995-03-13 | Paper |
| scientific article; zbMATH DE number 510777 (Why is no real title available?) | 1994-10-17 | Paper |
A Splitting Theorem for the N-R.E. Degrees
Proceedings of the American Mathematical Society | 1992-08-13 | Paper |
The d.r.e. degrees are not dense
Annals of Pure and Applied Logic | 1992-06-28 | Paper |
The density of the low\(_ 2\) \(n\)-r.e. degrees
Archive for Mathematical Logic | 1992-06-26 | Paper |
The strong anticupping property for recursively enumerable degrees
Journal of Symbolic Logic | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4160710 (Why is no real title available?) | 1990-01-01 | Paper |
The jump is definable in the structure of the degrees of unsolvability
Bulletin of the American Mathematical Society | 1990-01-01 | Paper |
Weak density and cupping in the d-r.e. degrees
Israel Journal of Mathematics | 1989-01-01 | Paper |
A jump class of noncappable degrees
Journal of Symbolic Logic | 1989-01-01 | Paper |
Properly Σ2 Enumeration Degrees
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1988-01-01 | Paper |
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1987-01-01 | Paper |
Complementing below recursively enumerable degrees
Annals of Pure and Applied Logic | 1987-01-01 | Paper |
On minimal pairs of enumeration degrees
Journal of Symbolic Logic | 1985-01-01 | Paper |
Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
Journal of Symbolic Logic | 1984-01-01 | Paper |
Partial degrees and the density problem
Journal of Symbolic Logic | 1982-01-01 | Paper |
Minimal pairs and high recursively enumerable degrees
Journal of Symbolic Logic | 1975-01-01 | Paper |
Minimal degrees and the jump operator
Journal of Symbolic Logic | 1973-01-01 | Paper |
Jump equivalence of the Δ20 hyperimmune sets
Journal of Symbolic Logic | 1972-01-01 | Paper |
Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
Annals of Mathematical Logic | 1972-01-01 | Paper |
Minimal Upper Bounds for Sequences of Recursively Enumerable Degrees
Journal of the London Mathematical Society | 1972-01-01 | Paper |
