S. Barry Cooper

Publication Activity (10 Years)

Years Active: 1972-2024
Publications (10 Years): 8

Top Topics

Dense Optical Flow

Community Structure

Top Venues

Ann. Pure Appl. Log.

Publications

S. Barry Cooper
If CiE Did Not Exist, It Would Be Necessary to Invent It. CiE (2024)
S. Barry Cooper, James Gay, Charles M. Harris, Kyung Il Lee, Anthony Morphett
Linearisations and the Ershov hierarchy. Comput. 7 (2-3) (2018)
S. Barry Cooper, Andy Lewis-Pye, Angsheng Li, Yicheng Pan
Establishing social cooperation: The role of hubs and community structure. Netw. Sci. 6 (2) (2018)
S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]. Ann. Pure Appl. Log. 168 (12) (2017)
Charles M. Harris, Kyung Il Lee, S. Barry Cooper
-like computable linear orderings and Kierstead's conjecture. Math. Log. Q. 62 (6) (2016)
S. Barry Cooper
'Real' information is not flat - and why it matters. J. Exp. Theor. Artif. Intell. 27 (1) (2015)
S. Barry Cooper
The machine as data: a computational view of emergence and definability. Synth. 192 (7) (2015)
S. Barry Cooper
The Machine as Data: A Computational View of Emergence and Definability. CoRR (2015)
T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
A Roadmap for TAMC. TAMC (2014)
George Barmpalias, Manindra Agrawal, S. Barry Cooper
Theory and Applications of Models of Computation at the Turing Centenary in China. Theor. Comput. Sci. 560 (2014)
S. Barry Cooper, Anuj Dawar, Martin Hyland, Benedikt Löwe
Turing Centenary Conference: How the World Computes. Ann. Pure Appl. Log. 165 (9) (2014)
S. Barry Cooper
The Mathematician's Bias - and the Return to Embodied Computation CoRR (2013)
S. Barry Cooper, Elham Kashefi, Prakash Panangaden
Preface to special issue: Developments In Computational Models 2010. Math. Struct. Comput. Sci. 23 (2) (2013)
S. Barry Cooper
What Makes a Computation Unconventional? CoRR (2013)
S. Barry Cooper, Mariya Ivanova Soskova
The incomputable. J. Log. Comput. 23 (6) (2013)
S. Barry Cooper, Vincent Danos
Editorial. Int. J. Softw. Informatics 7 (4) (2013)
S. Barry Cooper
Incomputability after Alan Turing CoRR (2013)
S. Barry Cooper
Turing's Titanic machine? Commun. ACM 55 (3) (2012)
Vasco Brattka, Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Elvira Mayordomo
Editorial. Comput. 1 (1) (2012)
S. Barry Cooper
Mathematics, Metaphysics and the Multiverse. Computation, Physics and Beyond (2012)
Alexandra A. Soskova, S. Barry Cooper, Andrea Sorbi
Computability at Logic Colloquium 2009. J. Log. Comput. 22 (4) (2012)
S. Barry Cooper
From Turing Machine to Morphogenesis: Forming and Informing Computation. TAMC (2012)
Cristian S. Calude, S. Barry Cooper
Introduction: computability of the physical. Math. Struct. Comput. Sci. 22 (5) (2012)
S. Barry Cooper
Turing centenary: The incomputable reality. Nat. 482 (7386) (2012)
Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova
enumeration degrees. Theor. Comput. Sci. 412 (18) (2011)
Jianer Chen, S. Barry Cooper
Algorithms, complexity and computational models. Theor. Comput. Sci. 412 (23) (2011)
S. Barry Cooper
Extending and interpreting Post's programme. Ann. Pure Appl. Log. 161 (6) (2010)
Manindra Agrawal, S. Barry Cooper, Angsheng Li
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009). Math. Struct. Comput. Sci. 20 (5) (2010)
S. Barry Cooper
The Computational Roots of Hyper-Causality? Int. J. Unconv. Comput. 6 (5) (2010)
Jin-yi Cai, S. Barry Cooper, Angsheng Li
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC). Math. Struct. Comput. Sci. 19 (1) (2009)
S. Barry Cooper, Elvira Mayordomo, Andrea Sorbi
Computation and Logic in the Real World: CiE 2007. Theory Comput. Syst. 45 (4) (2009)
S. Barry Cooper, Benedikt Löwe, Andrea Sorbi
Logic and Computation in the Real World: CiE 2007. J. Log. Comput. 19 (1) (2009)
S. Barry Cooper
The Extended Turing Model as Contextual Tool. TAMC (2009)
S. Barry Cooper, Hong Zhu
Preface: Algorithms, complexity and models of computation. Theor. Comput. Sci. 410 (11) (2009)
Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi
Foreword. Theor. Comput. Sci. 410 (4-5) (2009)
Samuel R. Buss, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi
Preface. Ann. Pure Appl. Log. 160 (3) (2009)
S. Barry Cooper
Emergence as a computability-theoretic phenomenon. Appl. Math. Comput. 215 (4) (2009)
S. Barry Cooper, Mariya Ivanova Soskova
How enumeration reducibility yields extended Harrington non-splitting. J. Symb. Log. 73 (2) (2008)
S. Barry Cooper, Matthew C. Salts, Guohua Wu
The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees. TAMC (2008)
S. Barry Cooper, Angsheng Li
On Lachlan's major sub-degree problem. Arch. Math. Log. 47 (4) (2008)
S. Barry Cooper, Herman Geuvers, Anand Pillay, Jouko A. Väänänen
Preface. Ann. Pure Appl. Log. 156 (1) (2008)
Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova
Total Degrees and Nonsplitting Properties of Enumeration Degrees. TAMC (2008)
Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan
Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17 (6) (2007)
S. Barry Cooper, Angsheng Li
Preface: Theory and applications of models of computation. Theor. Comput. Sci. 384 (1) (2007)
Mariya Ivanova Soskova, S. Barry Cooper
The Strongest Nonsplitting Theorem. TAMC (2007)
S. Barry Cooper, Benedikt Löwe, Peter van Emde Boas
Theory of Computation at CiE 2005. Theory Comput. Syst. 41 (1) (2007)
S. Barry Cooper, Benedikt Löwe, Dag Normann
Mathematics of computing at CiE 2005. Math. Struct. Comput. Sci. 16 (5) (2006)
Bahareh Afshari, George Barmpalias, S. Barry Cooper
-C.E. Hierarchy. TAMC (2006)
S. Barry Cooper
How Can Nature Help Us Compute? SOFSEM (2006)
S. Barry Cooper
Definability as hypercomputational effect. Appl. Math. Comput. 178 (1) (2006)
S. Barry Cooper
Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It. CiE (2005)
S. Barry Cooper, Andrew E. M. Lewis, Yue Yang
minimal degrees and 0'' complementation. Math. Log. Q. 51 (3) (2005)
S. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang
Bounding and nonbounding minimal pairs in the enumeration degrees. J. Symb. Log. 70 (3) (2005)
Marat M. Arslanov, Chi Tat Chong, S. Barry Cooper, Yue Yang
The minimal e-degree problem in fragments of Peano arithmetic. Ann. Pure Appl. Log. 131 (1-3) (2005)
Marat M. Arslanov, S. Barry Cooper, Angsheng Li
There is no low maximal d. c. e. degree - Corrigendum. Math. Log. Q. 50 (6) (2004)
S. Barry Cooper, Angsheng Li, Xiaoding Yi
On the distribution of Lachlan nonsplitting bases. Arch. Math. Log. 41 (5) (2002)
S. Barry Cooper, Angsheng Li
C.E. Degree above Which 0' Is Not Splittable. J. Symb. Log. 67 (4) (2002)
S. Barry Cooper
On a Conjecture of Kleene and Post. Math. Log. Q. 47 (1) (2001)
Marat M. Arslanov, S. Barry Cooper, Angsheng Li
There is No Low Maximal D.C.E. Degree. Math. Log. Q. 46 (3) (2000)
S. Barry Cooper, Andrea Sorbi, Xiaoding Yi
Sets. Ann. Pure Appl. Log. 82 (3) (1996)
S. Barry Cooper, Andrea Sorbi
. J. Symb. Log. 61 (4) (1996)
S. Barry Cooper
Strong Minimal Covers for Recursively Enumerable Degrees. Math. Log. Q. 42 (1996)
S. Barry Cooper
Beyond Gödel's Theorem: Turing Nonrigidity Revisited. Logic Colloquium (1995)
S. Barry Cooper, Xiaoding Yi
The discontinuity of splitting in the recursively enumerable degrees. Arch. Math. Log. 34 (4) (1995)
S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
The d.r.e. Degrees are Not Dense. Ann. Pure Appl. Log. 55 (2) (1991)
S. Barry Cooper
-r.e. degrees. Arch. Math. Log. 31 (1) (1991)
S. Barry Cooper
A Jump Class of Noncappable Degrees. J. Symb. Log. 54 (2) (1989)
S. Barry Cooper
The Strong Anticupping Property for Recursively Enumerable Degrees. J. Symb. Log. 54 (2) (1989)
S. Barry Cooper, C. S. Copestake
Enumeration Degrees. Math. Log. Q. 34 (6) (1988)
S. Barry Cooper, Richard L. Epstein
Complementing below recursively enumerable degrees. Ann. Pure Appl. Log. 34 (1) (1987)
S. Barry Cooper
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers. Math. Log. Q. 33 (6) (1987)
Kevin McEvoy, S. Barry Cooper
On Minimal Pairs of Enumeration Degrees. J. Symb. Log. 50 (4) (1985)
S. Barry Cooper
Sets are Dense. J. Symb. Log. 49 (2) (1984)
S. Barry Cooper
Partial Degrees and the Density Problem. J. Symb. Log. 47 (4) (1982)
S. Barry Cooper
Minimal Pairs and High Recursively Enumerable Degrees. J. Symb. Log. 39 (4) (1974)
S. Barry Cooper
Minimal Degrees and the Jump Operator. J. Symb. Log. 38 (2) (1973)
S. Barry Cooper
Hyperhyperimmune Sets. J. Symb. Log. 37 (3) (1972)