| Linearisations And The Ershov Hierarchy | 0 | 0.34 | 2018 |
| Establishing Social Cooperation: The Role Of Hubs And Community Structure | 0 | 0.34 | 2018 |
| Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]. | 0 | 0.34 | 2017 |
| Automorphisms of η-Like Computable Linear Orderings and Kierstead’s Conjecture | 1 | 0.41 | 2016 |
| The Machine as Data: A Computational View of Emergence and Definability | 1 | 0.41 | 2015 |
| A Roadmap for TAMC. | 0 | 0.34 | 2014 |
| Turing Centenary Conference: How the World Computes. | 1 | 0.41 | 2014 |
| Theory and Applications of Models of Computation at the Turing Centenary in China. | 0 | 0.34 | 2014 |
| Incomputability after Alan Turing | 2 | 0.50 | 2013 |
| What Makes a Computation Unconventional? | 1 | 0.40 | 2013 |
| Preface to special issue: Developments In Computational Models 2010. | 0 | 0.34 | 2013 |
| The incomputable. | 0 | 0.34 | 2013 |
| Turing's Titanic machine? | 16 | 0.76 | 2012 |
| Computability at Logic Colloquium 2009 | 0 | 0.34 | 2012 |
| Mathematics, metaphysics and the multiverse | 1 | 0.36 | 2012 |
| How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings | 75 | 7.46 | 2012 |
| From turing machine to morphogenesis: forming and informing computation | 0 | 0.34 | 2012 |
| Introduction: computability of the physical | 0 | 0.34 | 2012 |
| Algorithms, complexity and computational models | 0 | 0.34 | 2011 |
| Extending and interpreting Post’s programme | 1 | 0.38 | 2010 |
| The Computational Roots Of Hyper-Causality | 0 | 0.34 | 2010 |
| Preface to special issue: Theory and applications of models of computation (tamc 2008–2009) | 0 | 0.34 | 2010 |
| Emergence as a computability-theoretic phenomenon | 8 | 0.86 | 2009 |
| Preface: Algorithms, complexity and models of computation | 0 | 0.34 | 2009 |
| The Extended Turing Model as Contextual Tool | 0 | 0.34 | 2009 |
| Computation and Logic in the Real World: CiE 2007 | 2 | 0.38 | 2009 |
| Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings | 32 | 1.98 | 2009 |
| Logic and Computation in the Real World: CiE 2007 | 0 | 0.34 | 2009 |
| Preface to special issue: Theory and applications of models of computation (tamc) | 2 | 0.49 | 2009 |
| Total Degrees and Nonsplitting Properties of Enumeration Degrees | 0 | 0.34 | 2008 |
| The non-isolating degrees are upwards dense in the computably enumerable degrees | 0 | 0.34 | 2008 |
| On Lachlan's major sub-degree problem | 3 | 0.61 | 2008 |
| How enumeration reducibility yields extended Harrington non-splitting | 1 | 0.42 | 2008 |
| Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings | 70 | 6.27 | 2007 |
| Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings | 60 | 4.32 | 2007 |
| Preface: Theory and applications of models of computation | 0 | 0.34 | 2007 |
| Theory of Computation at CiE 2005 | 0 | 0.34 | 2007 |
| Post's Programme for the Ershov Hierarchy | 5 | 0.50 | 2007 |
| The strongest nonsplitting theorem | 0 | 0.34 | 2007 |
| Mathematics of computing at CiE 2005 | 0 | 0.34 | 2006 |
| Immunity properties and the n-C.E. hierarchy | 3 | 0.43 | 2006 |
| How can nature help us compute? | 10 | 0.99 | 2006 |
| Definability as hypercomputational effect | 7 | 0.78 | 2006 |
| Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings | 68 | 5.04 | 2006 |
| New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings | 54 | 15.86 | 2005 |
| Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It | 1 | 0.38 | 2005 |
| The minimal e-degree problem in fragments of Peano arithmetic | 0 | 0.34 | 2005 |
| Properly Sigma2 minimal degrees and 0'' complementation | 0 | 0.34 | 2005 |
| Bounding and nonbounding minimal pairs in the enumeration degrees | 7 | 1.18 | 2005 |
| There is no low maximal d. c. e. degree - Corrigendum | 4 | 0.72 | 2004 |
