S. Barry Cooper

According to our database1, S. Barry Cooper authored at least 79 papers between 1972 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Establishing social cooperation: The role of hubs and community structure.
Network Science, 2018

Linearisations and the Ershov hierarchy.
Computability, 2018

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

2016
Automorphisms of η-like computable linear orderings and Kierstead's conjecture.
Math. Log. Q., 2016

Alan Turing and Enigmatic Statistics.
Proceedings of the Once and Future Turing: Computing the World, 2016

2015
The machine as data: a computational view of emergence and definability.
Synthese, 2015

'Real' information is not flat - and why it matters.
J. Exp. Theor. Artif. Intell., 2015

The Machine as Data: A Computational View of Emergence and Definability.
CoRR, 2015

2014
Theory and Applications of Models of Computation at the Turing Centenary in China.
Theor. Comput. Sci., 2014

Turing Centenary Conference: How the World Computes.
Ann. Pure Appl. Logic, 2014

A Roadmap for TAMC.
Proceedings of the Theory and Applications of Models of Computation, 2014

2013
Preface to special issue: Developments In Computational Models 2010.
Mathematical Structures in Computer Science, 2013

The incomputable.
J. Log. Comput., 2013

Editorial.
Int. J. Software and Informatics, 2013

Incomputability after Alan Turing
CoRR, 2013

The Mathematician's Bias - and the Return to Embodied Computation
CoRR, 2013

What Makes a Computation Unconventional?
CoRR, 2013

2012
Turing centenary: The incomputable reality.
Nature, 2012

Introduction: computability of the physical.
Mathematical Structures in Computer Science, 2012

Computability at Logic Colloquium 2009.
J. Log. Comput., 2012

Editorial.
Computability, 2012

Turing's Titanic machine?
Commun. ACM, 2012

From Turing Machine to Morphogenesis: Forming and Informing Computation.
Proceedings of the Theory and Applications of Models of Computation, 2012

Mathematics, Metaphysics and the Multiverse.
Proceedings of the Computation, Physics and Beyond, 2012

2011
Algorithms, complexity and computational models.
Theor. Comput. Sci., 2011

Splitting and nonsplitting in the Σ20 enumeration degrees.
Theor. Comput. Sci., 2011

2010
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009).
Mathematical Structures in Computer Science, 2010

The Computational Roots of Hyper-Causality?
IJUC, 2010

Extending and interpreting Post's programme.
Ann. Pure Appl. Logic, 2010

2009
Preface: Algorithms, complexity and models of computation.
Theor. Comput. Sci., 2009

Foreword.
Theor. Comput. Sci., 2009

Computation and Logic in the Real World: CiE 2007.
Theory Comput. Syst., 2009

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC).
Mathematical Structures in Computer Science, 2009

Logic and Computation in the Real World: CiE 2007.
J. Log. Comput., 2009

Preface.
Ann. Pure Appl. Logic, 2009

Emergence as a computability-theoretic phenomenon.
Applied Mathematics and Computation, 2009

The Extended Turing Model as Contextual Tool.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008
Computability.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

How enumeration reducibility yields extended Harrington non-splitting.
J. Symb. Log., 2008

Preface.
Ann. Pure Appl. Logic, 2008

On Lachlan's major sub-degree problem.
Arch. Math. Log., 2008

The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees.
Proceedings of the Theory and Applications of Models of Computation, 2008

Total Degrees and Nonsplitting Properties of Enumeration Degrees.
Proceedings of the Theory and Applications of Models of Computation, 2008

2007
Preface: Theory and applications of models of computation.
Theor. Comput. Sci., 2007

Theory of Computation at CiE 2005.
Theory Comput. Syst., 2007

Post's Programme for the Ershov Hierarchy.
J. Log. Comput., 2007

The Strongest Nonsplitting Theorem.
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
Mathematics of computing at CiE 2005.
Mathematical Structures in Computer Science, 2006

Definability as hypercomputational effect.
Applied Mathematics and Computation, 2006

Immunity Properties and the n-C.E. Hierarchy.
Proceedings of the Theory and Applications of Models of Computation, 2006

How Can Nature Help Us Compute?
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

2005
Properly Sigma2 minimal degrees and 0'' complementation.
Math. Log. Q., 2005

Bounding and nonbounding minimal pairs in the enumeration degrees.
J. Symb. Log., 2005

The minimal e-degree problem in fragments of Peano arithmetic.
Ann. Pure Appl. Logic, 2005

Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It.
Proceedings of the New Computational Paradigms, 2005

2004
There is no low maximal d. c. e. degree - Corrigendum.
Math. Log. Q., 2004

Computability theory.
Chapman and Hall / CRC mathematics texts, Chapman & Hall, ISBN: 978-1-58488-237-4, 2004

2003
Computability and models - perspectives east and west.
The University series in mathematics, Springer, ISBN: 978-0-306-47400-2, 2003

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

On the distribution of Lachlan nonsplitting bases.
Arch. Math. Log., 2002

2001
On a Conjecture of Kleene and Post.
Math. Log. Q., 2001

2000
There is No Low Maximal D.C.E. Degree.
Math. Log. Q., 2000

1996
Strong Minimal Covers for Recursively Enumerable Degrees.
Math. Log. Q., 1996

Noncappable Enumeration Degrees Below 0'e.
J. Symb. Log., 1996

Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets.
Ann. Pure Appl. Logic, 1996

1995
The discontinuity of splitting in the recursively enumerable degrees.
Arch. Math. Log., 1995

1991
The d.r.e. Degrees are Not Dense.
Ann. Pure Appl. Logic, 1991

The density of the low2n-r.e. degrees.
Arch. Math. Log., 1991

1989
The Strong Anticupping Property for Recursively Enumerable Degrees.
J. Symb. Log., 1989

A Jump Class of Noncappable Degrees.
J. Symb. Log., 1989

1988
Properly Σ2 Enumeration Degrees.
Math. Log. Q., 1988

1987
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.
Math. Log. Q., 1987

Complementing below recursively enumerable degrees.
Ann. Pure Appl. Logic, 1987

1985
On Minimal Pairs of Enumeration Degrees.
J. Symb. Log., 1985

1984
Partial Degrees and the Density Problem. Part 2: The Enumeration Degrees of the sigma2 Sets are Dense.
J. Symb. Log., 1984

1982
Partial Degrees and the Density Problem.
J. Symb. Log., 1982

1974
Minimal Pairs and High Recursively Enumerable Degrees.
J. Symb. Log., 1974

1973
Minimal Degrees and the Jump Operator.
J. Symb. Log., 1973

1972
Jump Equivalence of the triangle 02 Hyperhyperimmune Sets.
J. Symb. Log., 1972


  Loading...