Jump Equivalence of the triangle 02 Hyperhyperimmune Sets. - S. Barry Cooper (J. Symb. Log., 1972)

Minimal Degrees and the Jump Operator. - S. Barry Cooper (J. Symb. Log., 1973)

Minimal Pairs and High Recursively Enumerable Degrees. - S. Barry Cooper (J. Symb. Log., 1974)

Partial Degrees and the Density Problem. - S. Barry Cooper (J. Symb. Log., 1982)

Partial Degrees and the Density Problem. Part 2: The Enumeration Degrees of the sigma2 Sets are Dense. - S. Barry Cooper (J. Symb. Log., 1984)

On Minimal Pairs of Enumeration Degrees. - Kevin McEvoy; S. Barry Cooper (J. Symb. Log., 1985)

Complementing below recursively enumerable degrees. - S. Barry Cooper; Richard L. Epstein (Ann. Pure Appl. Log., 1987)

Enumeration Reducibility Using Bounded Information: Counting Minimal Covers. - S. Barry Cooper (Math. Log. Q., 1987)

Properly Σ2 Enumeration Degrees. - S. Barry Cooper; C. S. Copestake (Math. Log. Q., 1988)

A Jump Class of Noncappable Degrees. - S. Barry Cooper (J. Symb. Log., 1989)

The Strong Anticupping Property for Recursively Enumerable Degrees. - S. Barry Cooper (J. Symb. Log., 1989)

The density of the low2n-r.e. degrees. - S. Barry Cooper (Arch. Math. Log., 1991)

The d.r.e. Degrees are Not Dense. - S. Barry Cooper; Leo Harrington; Alistair H. Lachlan; Steffen Lempp; Robert I. Soare (Ann. Pure Appl. Log., 1991)

Beyond Gödel's Theorem: Turing Nonrigidity Revisited. - S. Barry Cooper (Logic Colloquium, 1995)

The discontinuity of splitting in the recursively enumerable degrees. - S. Barry Cooper; Xiaoding Yi (Arch. Math. Log., 1995)

Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets. - S. Barry Cooper; Andrea Sorbi; Xiaoding Yi (Ann. Pure Appl. Log., 1996)

Noncappable Enumeration Degrees Below 0'e. - S. Barry Cooper; Andrea Sorbi (J. Symb. Log., 1996)

Strong Minimal Covers for Recursively Enumerable Degrees. - S. Barry Cooper (Math. Log. Q., 1996)

Local Degree Theory. - S. Barry Cooper (Handbook of Computability Theory, 1999)

There is No Low Maximal D.C.E. Degree. - Marat M. Arslanov; S. Barry Cooper; Angsheng Li (Math. Log. Q., 2000)

On a Conjecture of Kleene and Post. - S. Barry Cooper (Math. Log. Q., 2001)

On the distribution of Lachlan nonsplitting bases. - S. Barry Cooper; Angsheng Li; Xiaoding Yi (Arch. Math. Log., 2002)

Splitting and Nonsplitting, II: A Low2 C.E. Degree above Which 0' Is Not Splittable. - S. Barry Cooper; Angsheng Li (J. Symb. Log., 2002)

Computability and models - perspectives east and west. - S. Barry Cooper; Sergey S. Goncharov (Springer, 2003)

Computability theory. - S. Barry Cooper (Chapman & Hall, 2004)

There is no low maximal d. c. e. degree - Corrigendum. - Marat M. Arslanov; S. Barry Cooper; Angsheng Li (Math. Log. Q., 2004)

Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It. - S. Barry Cooper (CiE, 2005)

The minimal e-degree problem in fragments of Peano arithmetic. - Marat M. Arslanov; Chi Tat Chong; S. Barry Cooper; Yue Yang 004 (Ann. Pure Appl. Log., 2005)

Bounding and nonbounding minimal pairs in the enumeration degrees. - S. Barry Cooper; Angsheng Li; Andrea Sorbi; Yue Yang 004 (J. Symb. Log., 2005)

Properly Sigma2 minimal degrees and 0'' complementation. - S. Barry Cooper; Andrew E. M. Lewis; Yue Yang 004 (Math. Log. Q., 2005)

How Can Nature Help Us Compute? - S. Barry Cooper (SOFSEM, 2006)

Immunity Properties and the n-C.E. Hierarchy. - Bahareh Afshari; George Barmpalias; S. Barry Cooper (TAMC, 2006)

Definability as hypercomputational effect. - S. Barry Cooper (Appl. Math. Comput., 2006)

Mathematics of computing at CiE 2005. - S. Barry Cooper; Benedikt Löwe; Dag Normann (Math. Struct. Comput. Sci., 2006)

The Strongest Nonsplitting Theorem. - Mariya Ivanova Soskova; S. Barry Cooper (TAMC, 2007)

Post's Programme for the Ershov Hierarchy. - Bahareh Afshari; George Barmpalias; S. Barry Cooper; Frank Stephan 001 (J. Log. Comput., 2007)

Theory of Computation at CiE 2005. - S. Barry Cooper; Benedikt Löwe; Peter van Emde Boas (Theory Comput. Syst., 2007)

Preface: Theory and applications of models of computation. - S. Barry Cooper; Angsheng Li (Theor. Comput. Sci., 2007)

Total Degrees and Nonsplitting Properties of Enumeration Degrees. - Marat M. Arslanov; S. Barry Cooper; Iskander Sh. Kalimullin; Mariya Ivanova Soskova (TAMC, 2008)

The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees. - S. Barry Cooper; Matthew C. Salts; Guohua Wu (TAMC, 2008)

On Lachlan's major sub-degree problem. - S. Barry Cooper; Angsheng Li (Arch. Math. Log., 2008)

Preface. - S. Barry Cooper; Herman Geuvers; Anand Pillay; Jouko A. Väänänen (Ann. Pure Appl. Log., 2008)

How enumeration reducibility yields extended Harrington non-splitting. - S. Barry Cooper; Mariya Ivanova Soskova (J. Symb. Log., 2008)

Computability. - S. Barry Cooper (Wiley Encyclopedia of Computer Science and Engineering, 2008)

The Extended Turing Model as Contextual Tool. - S. Barry Cooper (TAMC, 2009)

Emergence as a computability-theoretic phenomenon. - S. Barry Cooper (Appl. Math. Comput., 2009)

Preface. - Samuel R. Buss; S. Barry Cooper; Benedikt Löwe; Andrea Sorbi (Ann. Pure Appl. Log., 2009)

Logic and Computation in the Real World: CiE 2007. - S. Barry Cooper; Benedikt Löwe; Andrea Sorbi (J. Log. Comput., 2009)

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC). - Jin-yi Cai; S. Barry Cooper; Angsheng Li (Math. Struct. Comput. Sci., 2009)

Computation and Logic in the Real World: CiE 2007. - S. Barry Cooper; Elvira Mayordomo; Andrea Sorbi (Theory Comput. Syst., 2009)

Foreword. - Paola Bonizzoni; S. Barry Cooper; Benedikt Löwe; Andrea Sorbi (Theor. Comput. Sci., 2009)

Preface: Algorithms, complexity and models of computation. - S. Barry Cooper; Hong Zhu 004 (Theor. Comput. Sci., 2009)

Extending and interpreting Post's programme. - S. Barry Cooper (Ann. Pure Appl. Log., 2010)

The Computational Roots of Hyper-Causality? - S. Barry Cooper (Int. J. Unconv. Comput., 2010)

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009). - Manindra Agrawal; S. Barry Cooper; Angsheng Li (Math. Struct. Comput. Sci., 2010)

Splitting and nonsplitting in the Σ20 enumeration degrees. - Marat M. Arslanov; S. Barry Cooper; Iskander Sh. Kalimullin; Mariya Ivanova Soskova (Theor. Comput. Sci., 2011)

Algorithms, complexity and computational models. - Jianer Chen; S. Barry Cooper (Theor. Comput. Sci., 2011)

Mathematics, Metaphysics and the Multiverse. - S. Barry Cooper (Computation, Physics and Beyond, 2012)

From Turing Machine to Morphogenesis: Forming and Informing Computation. - S. Barry Cooper (TAMC, 2012)

Turing's Titanic machine? - S. Barry Cooper (Commun. ACM, 2012)

Editorial. - Vasco Brattka; Paola Bonizzoni; S. Barry Cooper; Benedikt Löwe; Elvira Mayordomo (Comput., 2012)

Computability at Logic Colloquium 2009. - Alexandra A. Soskova; S. Barry Cooper; Andrea Sorbi (J. Log. Comput., 2012)

Introduction: computability of the physical. - Cristian S. Calude; S. Barry Cooper (Math. Struct. Comput. Sci., 2012)

Turing centenary: The incomputable reality. - S. Barry Cooper (Nat., 2012)

What Makes a Computation Unconventional? - S. Barry Cooper (CoRR, 2013)

The Mathematician's Bias - and the Return to Embodied Computation - S. Barry Cooper (CoRR, 2013)

Incomputability after Alan Turing - S. Barry Cooper (CoRR, 2013)

Editorial. - S. Barry Cooper; Vincent Danos (Int. J. Softw. Informatics, 2013)

The incomputable. - S. Barry Cooper; Mariya Ivanova Soskova (J. Log. Comput., 2013)

Preface to special issue: Developments In Computational Models 2010. - S. Barry Cooper; Elham Kashefi; Prakash Panangaden (Math. Struct. Comput. Sci., 2013)

A Roadmap for TAMC. - T. V. Gopal; Manindra Agrawal; Angsheng Li; S. Barry Cooper (TAMC, 2014)

Turing Centenary Conference: How the World Computes. - S. Barry Cooper; Anuj Dawar; Martin Hyland; Benedikt Löwe (Ann. Pure Appl. Log., 2014)

Theory and Applications of Models of Computation at the Turing Centenary in China. - George Barmpalias; Manindra Agrawal; S. Barry Cooper (Theor. Comput. Sci., 2014)

'Real' information is not flat - and why it matters. - S. Barry Cooper (J. Exp. Theor. Artif. Intell., 2015)

The machine as data: a computational view of emergence and definability. - S. Barry Cooper (Synth., 2015)

Alan Turing and Enigmatic Statistics. - Kanti V. Mardia; S. Barry Cooper (The Once and Future Turing, 2016)

Automorphisms of η-like computable linear orderings and Kierstead's conjecture. - Charles M. Harris; Kyung Il Lee; S. Barry Cooper (Math. Log. Q., 2016)

Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]. - S. Barry Cooper; Leo Harrington; Alistair H. Lachlan; Steffen Lempp; Robert I. Soare (Ann. Pure Appl. Log., 2017)

Linearisations and the Ershov hierarchy. - S. Barry Cooper; James Gay; Charles M. Harris; Kyung Il Lee; Anthony Morphett (Comput., 2018)

Establishing social cooperation: The role of hubs and community structure. - S. Barry Cooper; Andy Lewis-Pye; Angsheng Li; Yicheng Pan 001 (Netw. Sci., 2018)

If CiE Did Not Exist, It Would Be Necessary to Invent It. - S. Barry Cooper (CiE, 2024)