S. Barry Cooper

Q: What Schools Are Affiliated With S. Barry Cooper

S. Barry Cooper is affiliated with the following schools: University of Leicester, University of Leeds

S. Barry Cooper's AcademicInfluence.com Rankings

S. Barry Cooper

Philosophy

#1703

World Rank

#3041

Historical Rank

Logic

#741

World Rank

#1264

Historical Rank

philosophy Degrees

Download Badge

Philosophy

Why Is S. Barry Cooper Influential?

(Suggest an Edit or Addition)

According to Wikipedia, S. Barry Cooper was an English mathematician and computability theorist. He was a professor of Pure Mathematics at the University of Leeds. Early life and education Cooper grew up in Bognor Regis and attended Chichester High School for Boys, during which time he played scrum-half for the under-15s England rugby team.

(See a Problem?)

S. Barry Cooper's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Universal quantum computation using the discrete-time quantum walk (2009) (384)
On Computable Numbers, with an Application to the Entscheidungsproblem – A Correction (2013) (273)
Systems of Logic Based on Ordinals (2013) (182)
Turing’s Lecture to the London Mathematical Society on 20 February 1947 (2013) (158)
Digital Computers Applied to Games (2013) (158)
Computability In Context: Computation and Logic in the Real World (2009) (150)
New Computational Paradigms: Changing Conceptions of What is Computable (2007) (111)
New Computational Paradigms (2005) (103)
Computational Complexity Theory (89)
Enumeration reducibility, nondeterministic computations and relative computability of partial functions (1990) (89)
The d.r.e. Degrees are Not Dense (1991) (85)
Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense (1984) (84)
Partial degrees and the density problem (1982) (80)
On the Gaussian error function (2013) (79)
Minimal degrees and the jump operator (1973) (70)
On minimal pairs of enumeration degrees (1985) (64)
Minimal pairs and high recursively enumerable degrees (1974) (57)
Incomputability in Nature (2003) (56)
Alan Turing: His Work and Impact (2013) (53)
Weak density and cupping in the d-r.e. degrees (1989) (49)
Computability, enumerability, unsolvability: directions in recursion theory (1996) (42)
Solvable and Unsolvable Problems (2013) (39)
The jump is definable in the structure of the degrees of unsolvability (1990) (34)
Computability And Models (2003) (33)
Splitting Properties of Total Enumeration Degrees (2003) (32)
The Once and Future Turing: Computing the World (2016) (30)
Properly Σ2 Enumeration Degrees (1988) (30)
The strong anticupping property for recursively enumerable degrees (1989) (28)
Degrees of unsolvability complementary between recursively enumerable degrees, Part 1 (1972) (26)
Rounding-off Errors in Matrix Processes (2013) (25)
Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets (1996) (25)
Turing's Titanic machine? (2012) (25)
There is No Low Maximal D.C.E. Degree (2000) (24)
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers (1987) (22)
The density of the low2n-r.e. degrees (1991) (22)
Models and Computability: Clockwork or Turing U/universe? - Remarks on Causal Determinism and Computability (1999) (21)
Mathematics of Computation at CiE 2005 (2006) (20)
Turing Definability in the Ershov Hierarchy (2002) (18)
Post's Programme for the Ershov Hierarchy (2007) (18)
Emergence as a computability-theoretic phenomenon (2009) (18)
There is no low maximal d. c. e. degree – Corrigendum (2004) (17)
Computability and models - perspectives east and west (2012) (17)
How Can Nature Help Us Compute? (2006) (17)
Incomputability after Alan Turing (2012) (15)
Complementing below recursively enumerable degrees (1987) (14)
Bounding and nonbounding minimal pairs in the enumeration degrees (2005) (14)
Turing centenary: The incomputable reality (2012) (14)
Definability as hypercomputational effect (2006) (13)
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC) (2009) (13)
How the World Computes (2012) (13)
Computability and Emergence (2006) (12)
Non-Uniformity and Generalised Sacks Splitting (2002) (12)
A Note on Normal Numbers (2013) (12)
A jump class of noncappable degrees (1989) (11)
Theory and Applications of Models of Computation (2014) (11)
The Reform of Mathematical Notation and Phraseology (2013) (11)
The mathematics of nature at the Alan Turing centenary (2012) (11)
Local Degree Theory (1999) (10)
Splitting and cone avoidance in the D.C.E. degrees (2002) (10)
The Mathematician's Bias - and the Return to Embodied Computation (2013) (10)
Minimal Upper Bounds for Sequences of Recursively Enumerable Degrees (1972) (10)
On a Conjecture of Kleene and Post (2001) (10)
Initial Segments of Recursive Linear Orders (1997) (10)
Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable (2002) (9)
How the World Computes : Turing Centenary Conference and Eighth Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012 : proceedings (2012) (9)
The Incomputable Alan Turing (2004) (8)
Rigidity and definability in the noncomputable universe (1995) (7)
Computing Machinery and Intelligence (2013) (7)
The foundations of computation, physics and mentality: the Turing legacy (2012) (7)
On the distribution of Lachlan nonsplitting bases (2002) (7)
Upper Cones As Automorphism Bases (1999) (6)
Definability and global degree theory (1993) (6)
On Lachlan’s major sub-degree problem (2008) (6)
FROM DESCARTES TO TURING: THE COMPUTATIONAL CONTENT OF SUPERVENIENCE (2011) (6)
Alan Turing and Enigmatic Statistics (2016) (6)
New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings (2005) (6)
The machine as data: a computational view of emergence and definability (2015) (6)
How the World Computes Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012 (2012) (5)
Noncappable enumeration degrees below 0e′ (1996) (5)
A characterisation of the jumps of minimal degree below 0 (1996) (5)
Discontinuous phenomena and Turing definability (1996) (5)
Computation and Logic in the Real World: CiE 2007 (2009) (4)
Automorphisms of η‐like computable linear orderings and Kierstead's conjecture (2016) (4)
Beyond Gödel's Theorem: Turing Nonrigidity Revisited (1995) (4)
Incomputability, Emergence and the Turing Universe (2010) (4)
Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151] (2017) (4)
Proceedings of the First international conference on Computability in Europe: new Computational Paradigms (2005) (3)
Immunity Properties and the n-C.E. Hierarchy (2006) (3)
What Makes a Computation Unconventional? (2013) (3)
Embeddings into the Turing degrees (2009) (3)
Mathematics, Metaphysics and the Multiverse (2012) (3)
The discontinuity of splitting in the recursively enumerable degrees (1995) (3)
Properly Σ2 minimal degrees and 0″ complementation (2005) (3)
The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees (2008) (2)
Speech System ‘Delilah’ – Report on Progress (2013) (2)
Turing Centenary Conference: How the World Computes (2014) (2)
Strong Minimal Covers for Recursively Enumerable Degrees (1996) (2)
The Chemical Basis of Morphogenesis (2013) (2)
Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It (2005) (2)
Checking a Large Routine (2013) (2)
Computability and λ-Definability**Supported in part by NWO Project 612.000.936 CALMOC. (2013) (2)
Extending and interpreting Post's programme (2010) (1)
Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009) (1)
A Roadmap for TAMC (2014) (1)
Models and computability : invited papers from Logic Colloquium '97 - European Meeting of the Association for Symbolic Logic, Leeds, July 1997 (1999) (1)
Proceedings Sixth Workshop on Developments in Computational Models: Causality, Computation, and Physics, DCM 2010, Edinburgh, Scotland, 9-10th July 2010 (2010) (1)
DEFINABILITY IN THE REAL UNIVERSE (2011) (1)
Turing’s Treatise on the Enigma (Prof’s Book) (2013) (1)
Outline of the Development of the Daisy (2013) (1)
Beyond Gödel’s Theorem: The Failure to Capture Information Content (2019) (1)
From Turing Machine to Morphogenesis: Forming and Informing Computation (2012) (1)
Proceedings Sixth Workshop on Developments in Computational Models: Causality, Computation, and Physics: Preface (2010) (1)
Logic and Computation in the Real World: CiE 2007 (2009) (1)
Algorithms, complexity and computational models (2011) (1)
Computation and logic in the real world : Third Conference on Computability in Europe, CiE 2007 Siena, Italy, June 18-23, 2007 : proceedings (2007) (1)
Computability at Logic Colloquium 2009 (2012) (1)
Theory and Applications of Models of Computation: Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings (Lecture Notes in Computer Science) (2006) (1)
Alan Turing (2019) (0)
The p-Function in λ-K Conversion * (2013) (0)
Computability, Enumerability, Unsolvability: APPENDIX: Questions in Recursion Theory (1996) (0)
Theory of Computation at CiE 2005 (2007) (0)
Preface: Algorithms, complexity and models of computation (2009) (0)
Preface (2009) (0)
Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings (2006) (0)
The Reverse Engineering Road to Computing Life (2016) (0)
Excerpt from: Programmer’s Handbook for the Manchester Electronic Computer Mark II: Local Programming Methods and Conventions (2013) (0)
Preface: Theory and applications of models of computation (2007) (0)
Proceedings Fifth Workshop on Developments in Computational Models — Computational Models From Nature: Preface (2009) (0)
Computability, Enumerability, Unsolvability: Preface (1996) (0)
The use of Dots as Brackets in Church's System* (2013) (0)
The Morphogen Theory of Phyllotaxis: I. Geometrical and Descriptive Phyllotaxis: II. Chemical Theory of Morphogenesis: III. (Bernard Richards) A Solution of the Morphogenical Equations for the Case of Spherical Symmetry (2013) (0)
The machine as data: a computational view of emergence and definability (2015) (0)
The minimal e-degree problem in fragments of Peano arithmetic (2005) (0)
The Extended Turing Model as Contextual Tool (2009) (0)
The Computation of Processes, and Not Computing the Brain (2016) (0)
Theory and Applications of Models of Computation at the Turing Centenary in China (2014) (0)
1997 European Summer Meeting of the Association for Symbolic Logic (1998) (0)
On the Intensionality of Turing Definitions (0)
Preface to special issue: Developments In Computational Models 2010 (2013) (0)
On Permutation Groups1 (2013) (0)
‘Real’ information is not flat – and why it matters (2015) (0)
Mathematics of computing at CiE 2005 (2006) (0)
Biology, Mind, and the Outer Reaches of Quantum Computation (2016) (0)
Incomputability Emergent, and Higher Type Computation (2015) (0)
The Computational Roots of Hyper-Causality? (2010) (0)
Alan Mathison Turing by Max Newman (2013) (0)
Inside Our Computable World, and the Mathematics of Universality (2016) (0)
Turing's contributions to the early Manchester computers (2013) (0)
Sets and proofs : invited papers from Logic Colloquium '97 - European Meeting of the Association for Symbolic Logic, Leeds, July 1997 (1999) (0)
Establishing social cooperation: The role of hubs and community structure (2018) (0)
Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings (2007) (0)
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008–2009) (2010) (0)
Can Digital Computers Think?: Intelligent Machinery: A Heretical Theory: Can Automatic Calculating Machines Be Said To Think? (2013) (0)
The Computability-Theoretic Content of Emergence (2011) (0)
There exists a maximal 3-C.E. enumeration degree (2003) (0)
Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature, DCM 2009, Rhodes, Greece, 11th July 2009 (2009) (0)
Theory and applications of models of computation : 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012 : proceedings (2012) (0)
The Word Problem in Semi-Groups with Cancellation (2013) (0)
Oracles, Infinitary Computation, and the Physics of the Mind (2016) (0)
Practical Forms of Type Theory (2013) (0)
Some Calculations of the Riemann Zeta function: On a Theorem of Littlewood (2013) (0)
Theory and applications of models of computation : 6th International Conference, TAMC 2009, Changsa, China, May 18-22, 2009 : proceedings (2009) (0)
Linearisations and the Ershov hierarchy (2017) (0)
Foreword (2009) (0)
Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation (2012) (0)
What Makes a Computation Unconventional? or, there is no such thing as Non-Turing Computation (2013) (0)
Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007) (0)
From natural philosophy to computation, and back again (2012) (0)
Art and Computing : a Marriage Made in Mathematics (2014) (0)
Editorial (1964) (0)
Proceedings of the 4th international conference on Theory and applications of models of computation (2007) (0)
Models of Computability Incomputability and Oracle Machines Computability and Information Computable Enumerability (0)
Introduction: computability of the physical (2012) (0)
Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes (2012) (0)
Embodying Computation at Higher Types (2017) (0)

This paper list is powered by the following services:

Other Resources About S. Barry Cooper

en.wikipedia.org

What Schools Are Affiliated With S. Barry Cooper?

S. Barry Cooper is affiliated with the following schools:

S. Barry Cooper's Academic­Influence.com Rankings