S. Barry Cooper

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2018

Establishing social cooperation: The role of hubs and community structure.

[BibT_eX]

[DOI]

Netw. Sci., 2018

Linearisations and the Ershov hierarchy.

[BibT_eX]

[DOI]

Comput., 2018

2017

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

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2017

2016

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

[BibT_eX]

[DOI]

Charles M. Harris

Kyung Il Lee

Math. Log. Q., 2016

Alan Turing and Enigmatic Statistics.

[BibT_eX]

[DOI]

Kanti V. Mardia

Proceedings of the Once and Future Turing: Computing the World, 2016

2015

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

[BibT_eX]

[DOI]

Synth., 2015

'Real' information is not flat - and why it matters.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 2015

2014

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

[BibT_eX]

[DOI]

George Barmpalias

Manindra Agrawal

Theor. Comput. Sci., 2014

Turing Centenary Conference: How the World Computes.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2014

A Roadmap for TAMC.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

2013

Preface to special issue: Developments In Computational Models 2010.

[BibT_eX]

[DOI]

Elham Kashefi

Prakash Panangaden

Math. Struct. Comput. Sci., 2013

The incomputable.

[BibT_eX]

[DOI]

J. Log. Comput., 2013

Editorial.

[BibT_eX]

[DOI]

Vincent Danos

Int. J. Softw. Informatics, 2013

Incomputability after Alan Turing

[BibT_eX]

[DOI]

CoRR, 2013

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

[BibT_eX]

[DOI]

CoRR, 2013

What Makes a Computation Unconventional?

[BibT_eX]

[DOI]

CoRR, 2013

2012

Turing centenary: The incomputable reality.

[BibT_eX]

[DOI]

Nat., 2012

Introduction: computability of the physical.

[BibT_eX]

[DOI]

Cristian S. Calude

Math. Struct. Comput. Sci., 2012

Computability at Logic Colloquium 2009.

[BibT_eX]

[DOI]

Alexandra A. Soskova

J. Log. Comput., 2012

Editorial.

[BibT_eX]

[DOI]

Comput., 2012

Turing's Titanic machine?

[BibT_eX]

[DOI]

Commun. ACM, 2012

From Turing Machine to Morphogenesis: Forming and Informing Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

Mathematics, Metaphysics and the Multiverse.

[BibT_eX]

[DOI]

Proceedings of the Computation, Physics and Beyond, 2012

2011

Algorithms, complexity and computational models.

[BibT_eX]

[DOI]

Jianer Chen

Theor. Comput. Sci., 2011

Splitting and nonsplitting in the Σ20 enumeration degrees.

[BibT_eX]

[DOI]

Iskander Sh. Kalimullin

Theor. Comput. Sci., 2011

2010

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

[BibT_eX]

[DOI]

Manindra Agrawal

Math. Struct. Comput. Sci., 2010

The Computational Roots of Hyper-Causality?

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2010

Extending and interpreting Post's programme.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2010

2009

Preface: Algorithms, complexity and models of computation.

[BibT_eX]

[DOI]

Hong Zhu

Theor. Comput. Sci., 2009

Foreword.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Computation and Logic in the Real World: CiE 2007.

[BibT_eX]

[DOI]

Elvira Mayordomo

Theory Comput. Syst., 2009

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC).

[BibT_eX]

[DOI]

Jin-yi Cai

Math. Struct. Comput. Sci., 2009

Logic and Computation in the Real World: CiE 2007.

[BibT_eX]

[DOI]

Benedikt Löwe

J. Log. Comput., 2009

Preface.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2009

Emergence as a computability-theoretic phenomenon.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2009

The Extended Turing Model as Contextual Tool.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008

Computability.

[BibT_eX]

[DOI]

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

How enumeration reducibility yields extended Harrington non-splitting.

[BibT_eX]

[DOI]

J. Symb. Log., 2008

Preface.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2008

On Lachlan's major sub-degree problem.

[BibT_eX]

[DOI]

Arch. Math. Log., 2008

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

[BibT_eX]

[DOI]

Matthew C. Salts

Guohua Wu

Proceedings of the Theory and Applications of Models of Computation, 2008

Total Degrees and Nonsplitting Properties of Enumeration Degrees.

[BibT_eX]

[DOI]

Iskander Sh. Kalimullin

Proceedings of the Theory and Applications of Models of Computation, 2008

2007

Preface: Theory and applications of models of computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Theory of Computation at CiE 2005.

[BibT_eX]

[DOI]

Benedikt Löwe

Peter van Emde Boas

Theory Comput. Syst., 2007

Post's Programme for the Ershov Hierarchy.

[BibT_eX]

[DOI]

J. Log. Comput., 2007

The Strongest Nonsplitting Theorem.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

Mathematics of computing at CiE 2005.

[BibT_eX]

[DOI]

Benedikt Löwe

Dag Normann

Math. Struct. Comput. Sci., 2006

Definability as hypercomputational effect.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2006

Immunity Properties and the n-C.E. Hierarchy.

[BibT_eX]

[DOI]

Bahareh Afshari

George Barmpalias

Proceedings of the Theory and Applications of Models of Computation, 2006

How Can Nature Help Us Compute?

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

2005

Properly Sigma2 minimal degrees and 0'' complementation.

[BibT_eX]

[DOI]

Andrew E. M. Lewis

Yue Yang

Math. Log. Q., 2005

Bounding and nonbounding minimal pairs in the enumeration degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 2005

The minimal e-degree problem in fragments of Peano arithmetic.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2005

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

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

2004

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

[BibT_eX]

[DOI]

Math. Log. Q., 2004

Computability theory.

[BibT_eX]

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

2003

Computability and models - perspectives east and west.

[BibT_eX]

Sergey S. Goncharov

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.

[BibT_eX]

[DOI]

J. Symb. Log., 2002

On the distribution of Lachlan nonsplitting bases.

[BibT_eX]

[DOI]

Xiaoding Yi

Arch. Math. Log., 2002

2001

On a Conjecture of Kleene and Post.

[BibT_eX]

[DOI]

Math. Log. Q., 2001

2000

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

[BibT_eX]

[DOI]

Math. Log. Q., 2000

1999

Local Degree Theory.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computability Theory, 1999

1996

Strong Minimal Covers for Recursively Enumerable Degrees.

[BibT_eX]

[DOI]

Math. Log. Q., 1996

Noncappable Enumeration Degrees Below 0'e.

[BibT_eX]

[DOI]

J. Symb. Log., 1996

Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets.

[BibT_eX]

[DOI]

Xiaoding Yi

Ann. Pure Appl. Log., 1996

1995

The discontinuity of splitting in the recursively enumerable degrees.

[BibT_eX]

[DOI]

Xiaoding Yi

Arch. Math. Log., 1995

Beyond Gödel's Theorem: Turing Nonrigidity Revisited.

[BibT_eX]

[DOI]

Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995

1991

The d.r.e. Degrees are Not Dense.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1991

The density of the low2n-r.e. degrees.

[BibT_eX]

[DOI]

Arch. Math. Log., 1991

1989

The Strong Anticupping Property for Recursively Enumerable Degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 1989

A Jump Class of Noncappable Degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 1989

1988

Properly Σ2 Enumeration Degrees.

[BibT_eX]

[DOI]

C. S. Copestake

Math. Log. Q., 1988

1987

Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.

[BibT_eX]

[DOI]

Math. Log. Q., 1987

Complementing below recursively enumerable degrees.

[BibT_eX]

[DOI]

Richard L. Epstein

Ann. Pure Appl. Log., 1987

1985

On Minimal Pairs of Enumeration Degrees.

[BibT_eX]

[DOI]

Kevin McEvoy

J. Symb. Log., 1985

1984

Partial Degrees and the Density Problem. Part 2: The Enumeration Degrees of the sigma2 Sets are Dense.

[BibT_eX]

[DOI]

J. Symb. Log., 1984

1982

Partial Degrees and the Density Problem.

[BibT_eX]

[DOI]

J. Symb. Log., 1982

1974

Minimal Pairs and High Recursively Enumerable Degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 1974

1973

Minimal Degrees and the Jump Operator.

[BibT_eX]

[DOI]

J. Symb. Log., 1973

1972

Jump Equivalence of the triangle 02 Hyperhyperimmune Sets.

[BibT_eX]

[DOI]