S. Barry Cooper

发表

Minimal degrees and the jump operator

S. Barry Cooper, S. Cooper, 1973, Journal of Symbolic Logic.

On the distribution of Lachlan nonsplitting bases

Angsheng Li, S. Barry Cooper, Xiaoding Yi, 2002, Arch. Math. Log..

Minimality Arguments for Infinite Time Turing Degrees

S. Barry Cooper, P. D. Welch, John K. Truss, 1999 .

Jump Equivalence of the triangle 02 Hyperhyperimmune Sets

S. Barry Cooper, 1972, J. Symb. Log..

Mathematics of computing at CiE 2005

Dag Normann, Benedikt Löwe, S. Barry Cooper, 2006, Math. Struct. Comput. Sci..

Preface to special issue: Developments In Computational Models 2010

Elham Kashefi, Prakash Panangaden, S. Barry Cooper, 2013, Math. Struct. Comput. Sci..

Enumeration Reducibility Using Bounded Information: Counting Minimal Covers

S. Barry Cooper, S. Cooper, 1987, Mathematical Logic Quarterly.

Partial degrees and the density problem

S. Barry Cooper, S. Cooper, 1982, Journal of Symbolic Logic.

Bounding and nonbounding minimal pairs in the enumeration degrees

Yue Yang, Andrea Sorbi, Angsheng Li, 2005, Journal of Symbolic Logic.

Beyond Gödel's Theorem: Turing Nonrigidity Revisited

S. Barry Cooper, 1995, Logic Colloquium.

The density of the low2n-r.e. degrees

S. Barry Cooper, 1991, Arch. Math. Log..

Sets and Proofs: Preface

S. Barry Cooper, John K. Truss, 1999 .

How Can Nature Help Us Compute?

S. Barry Cooper, S. Cooper, 2006, SOFSEM.

Splitting and Nonsplitting, II: A Low2 C.E. Degree above Which 0' Is Not Splittable

Angsheng Li, S. Barry Cooper, 2002, J. Symb. Log..

Strong Minimal Covers for Recursively Enumerable Degrees

S. Barry Cooper, S. Cooper, 1996, Math. Log. Q..

The Computation of Processes, and Not Computing the Brain

S. Barry Cooper, Andrew Hodges, 2016 .

Algorithms, complexity and computational models

Jianer Chen, S. Barry Cooper, 2011, Theor. Comput. Sci..

Noncappable enumeration degrees below 0e′

Andrea Sorbi, S. Barry Cooper, S. Cooper, 1996, Journal of Symbolic Logic.

Theory and Applications of Models of Computation at the Turing Centenary in China

George Barmpalias, Manindra Agrawal, S. Barry Cooper, 2014, Theor. Comput. Sci..

The Once and Future Turing: Computing the World

S. Barry Cooper, Andrew Hodges, 2016 .

Computation and Logic in the Real World: CiE 2007

Andrea Sorbi, S. Barry Cooper, Elvira Mayordomo, 2008, Theory of Computing Systems.

A jump class of noncappable degrees

S. Barry Cooper, S. Cooper, 1989, Journal of Symbolic Logic.

Extending and interpreting Post's programme

S. Barry Cooper, S. Cooper, 2010, Ann. Pure Appl. Log..

Alan Turing and Enigmatic Statistics

Kanti V. Mardia, S. Barry Cooper, K. Mardia, 2016, The Once and Future Turing.

Editorial

Vincent Danos, S. Barry Cooper, 2013, Int. J. Softw. Informatics.

The Extended Turing Model as Contextual Tool

S. Barry Cooper, 2009, TAMC.

Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense

S. Barry Cooper, S. Cooper, 1984, Journal of Symbolic Logic.

Preface: Algorithms, complexity and models of computation

Hong Zhu, S. Barry Cooper, 2009, Theor. Comput. Sci..

Turing Centenary Conference: How the World Computes

Anuj Dawar, Benedikt Löwe, S. Barry Cooper, 2014, Ann. Pure Appl. Log..

Complementing below recursively enumerable degrees

Richard L. Epstein, S. Barry Cooper, S. Cooper, 1987, Ann. Pure Appl. Log..

Post's Programme for the Ershov Hierarchy

George Barmpalias, Frank Stephan, S. Barry Cooper, 2007, J. Log. Comput..

Incomputability after Alan Turing pdf

S. Barry Cooper, 2013, ArXiv.

A characterisation of the jumps of minimal degree below 0

S. Barry Cooper, 1996 .

Computability, Enumerability, Unsolvability: Preface

S. Barry Cooper, Theodore A. Slaman, Stanley S. Wainer, 1996 .

Preface

Samuel R. Buss, Andrea Sorbi, S. Barry Cooper, 2009, Ann. Pure Appl. Log..

Emergence as a computability-theoretic phenomenon

S. Barry Cooper, S. Cooper, 2009, Appl. Math. Comput..

Proceedings Fifth Workshop on Developments in Computational Models — Computational Models From Nature: Preface

S. Barry Cooper, Vincent Danos, 2009 .

Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]

Alistair H. Lachlan, Robert I. Soare, Steffen Lempp, 2017, Ann. Pure Appl. Log..

The incomputable

Mariya Ivanova Soskova, S. Barry Cooper, 2013, J. Log. Comput..

Turing’s Treatise on the Enigma (Prof’s Book)

S. Barry Cooper, 2013 .

The machine as data: a computational view of emergence and definability

S. Barry Cooper, S. Cooper, 2015, Synthese.

The Mathematician's Bias - and the Return to Embodied Computation pdf

S. Barry Cooper, S. Cooper, 2013, ArXiv.

From Turing Machine to Morphogenesis: Forming and Informing Computation

S. Barry Cooper, 2012, TAMC.

Total Degrees and Nonsplitting Properties of Enumeration Degrees

Mariya Ivanova Soskova, S. Barry Cooper, Iskander Sh. Kalimullin, 2008, TAMC.

Definability as hypercomputational effect

S. Barry Cooper, S. Cooper, 2006, Appl. Math. Comput..

Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World

Andrea Sorbi, Benedikt Löwe, S. Barry Cooper, 2007 .

The minimal e-degree problem in fragments of Peano arithmetic

Yue Yang, S. Barry Cooper, Chi Tat Chong, 2005, Ann. Pure Appl. Log..

Minimal Pairs and High Recursively Enumerable Degrees

S. Barry Cooper, 1974, J. Symb. Log..

How enumeration reducibility yields extended Harrington non-splitting

Mariya Ivanova Soskova, S. Barry Cooper, 2008, J. Symb. Log..

Alan Mathison Turing by Max Newman

S. Barry Cooper, S. Cooper, 2013 .

Logic and Computation in the Real World: CiE 2007

Andrea Sorbi, Benedikt Löwe, S. Barry Cooper, 2009, J. Log. Comput..

How the World Computes

Anuj Dawar, Benedikt Löwe, S. Barry Cooper, 2012, Lecture Notes in Computer Science.

Linearisations and the Ershov hierarchy

S. Barry Cooper, Kyung Il Lee, Charles M. Harris, 2018, Comput..

Introduction: computability of the physical

Cristian S. Calude, S. Barry Cooper, S. Cooper, 2012, Mathematical Structures in Computer Science.

Models and Computability: Frontmatter

S. Barry Cooper, John K. Truss, 1999 .

New Computational Paradigms

Benedikt Löwe, S. Barry Cooper, Leen Torenvliet, 2005 .

What Makes a Computation Unconventional? pdf

S. Barry Cooper, 2013, ArXiv.

Biology, Mind, and the Outer Reaches of Quantum Computation

S. Barry Cooper, Andrew Hodges, 2016 .

Turing's Titanic machine?

S. Barry Cooper, S. Cooper, Barry Cooper, 2012, Commun. ACM.

Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets

Andrea Sorbi, S. Barry Cooper, Xiaoding Yi, 1996, Ann. Pure Appl. Log..

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009)

Angsheng Li, Manindra Agrawal, S. Barry Cooper, 2010, Math. Struct. Comput. Sci..

The d.r.e. Degrees are Not Dense

Alistair H. Lachlan, Robert I. Soare, Steffen Lempp, 1991, Ann. Pure Appl. Log..

Local Degree Theory

S. Barry Cooper, S. Cooper, 1999, Handbook of Computability Theory.

The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees

Guohua Wu, S. Barry Cooper, Matthew C. Salts, 2008, TAMC.

Properly Σ2 Enumeration Degrees

S. Barry Cooper, C. S. Copestake, 1988, Math. Log. Q..

A Roadmap for TAMC

Angsheng Li, Manindra Agrawal, S. Barry Cooper, 2014, TAMC.

Mathematics, Metaphysics and the Multiverse

S. Barry Cooper, S. Barry Cooper, 2012, Computation, Physics and Beyond.

The Strongest Nonsplitting Theorem

Mariya Ivanova Soskova, S. Barry Cooper, 2007, TAMC.

Preface

Herman Geuvers, S. Barry Cooper, Jouko A. Väänänen, 1999, Ann. Pure Appl. Log..

Solvable and Unsolvable Problems

S. Barry Cooper, J. V. Leeuwen, S. B. Cooper, 2013 .

Establishing social cooperation: The role of hubs and community structure

Angsheng Li, Yicheng Pan, S. Barry Cooper, 2018, Network Science.

Rigidity and definability in the noncomputable universe

S. Barry Cooper, S. Cooper, 1995 .

Logic Colloquium 2006: Introduction

Herman Geuvers, S. Barry Cooper, Anand Pillay, 2009 .

On a Conjecture of Kleene and Post

S. Barry Cooper, 2001, Math. Log. Q..

Properly Sigma2 minimal degrees and 0'' complementation

Yue Yang, S. Barry Cooper, Andrew E. M. Lewis, 2005, Math. Log. Q..

The strong anticupping property for recursively enumerable degrees

S. Barry Cooper, S. Cooper, 1989, Journal of Symbolic Logic.

Preface: Theory and applications of models of computation

Angsheng Li, S. Barry Cooper, 2007, Theor. Comput. Sci..

The discontinuity of splitting in the recursively enumerable degrees

S. Barry Cooper, Xiaoding Yi, 1995, Arch. Math. Log..

‘Real’ information is not flat – and why it matters

S. Barry Cooper, S. Cooper, 2015, J. Exp. Theor. Artif. Intell..

Proceedings of the 4th international conference on Theory and applications of models of computation

S. Barry Cooper, Hong Zhu, Jin-yi Cai, 2007 .

Turing centenary: The incomputable reality

S. Barry Cooper, Barry Cooper, 2012, Nature.

Oracles, Infinitary Computation, and the Physics of the Mind

S. Barry Cooper, Andrew Hodges, 2016 .

Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It

S. Barry Cooper, 2005, CiE.

Editorial

Paola Bonizzoni, Benedikt Löwe, S. Barry Cooper, 2012, De Computis.

Splitting and nonsplitting in the Σ20 enumeration degrees

Mariya Ivanova Soskova, S. Barry Cooper, Iskander Sh. Kalimullin, 2011, Theor. Comput. Sci..

Theory of Computation at CiE 2005

Peter van Emde Boas, Benedikt Löwe, S. Barry Cooper, 2006, Theory of Computing Systems.

Automorphisms of η-like computable linear orderings and Kierstead's conjecture

S. Barry Cooper, Kyung Il Lee, Charles M. Harris, 2016, Math. Log. Q..

There is No Low Maximal D.C.E. Degree

Angsheng Li, S. Barry Cooper, Marat M. Arslanov, 2000, Math. Log. Q..

There is no low maximal d. c. e. degree - Corrigendum

Angsheng Li, S. Barry Cooper, Marat M. Arslanov, 2004, Math. Log. Q..

Immunity Properties and the n-C.E. Hierarchy

George Barmpalias, S. Barry Cooper, Bahareh Afshari, 2006, TAMC.

On Lachlan’s major sub-degree problem

Angsheng Li, S. Barry Cooper, S. Cooper, 2008, Arch. Math. Log..

Computability at Logic Colloquium 2009

Andrea Sorbi, S. Barry Cooper, Alexandra A. Soskova, 2012, J. Log. Comput..

The Computational Roots of Hyper-Causality?

S. Barry Cooper, R. Penrose, David Bohm, 2010, Int. J. Unconv. Comput..

On minimal pairs of enumeration degrees

Kevin McEvoy, S. Barry Cooper, Kevin McEvoy, 1985, Journal of Symbolic Logic.

A Note on Normal Numbers

S. Barry Cooper, 2013 .

Rounding-off Errors in Matrix Processes

S. Barry Cooper, S. Cooper, 2013 .

There is No Low Maximal D.C.E. Degree

Angsheng Li, S. Barry Cooper, Marat M. Arslanov, 2000 .

Weak density and cupping in the d-r.e. degrees

Steffen Lempp, S. Barry Cooper, S. Cooper, 1989 .

On a Conjecture of Kleene and Post

S. Barry Cooper, 2001 .

On Computable Numbers, with an Application to the Entscheidungsproblem – A Correction

S. Barry Cooper, S. Cooper, J. Leeuwen, 2013 .

Computability And Models

S. Barry Cooper, Sergey S. Goncharov, 2003 .