default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Barry Cooper
Person information
- affiliation: University of Leeds, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c12]S. Barry Cooper:
If CiE Did Not Exist, It Would Be Necessary to Invent It. CiE 2024: 3-9
2010 – 2019
- 2018
- [j61]S. Barry Cooper, James Gay, Charles M. Harris, Kyung Il Lee, Anthony Morphett:
Linearisations and the Ershov hierarchy. Comput. 7(2-3): 143-169 (2018) - [j60]S. Barry Cooper, Andy Lewis-Pye, Angsheng Li, Yicheng Pan:
Establishing social cooperation: The role of hubs and community structure. Netw. Sci. 6(2): 251-264 (2018) - 2017
- [j59]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): 2164-2165 (2017) - [e12]S. Barry Cooper, Mariya Ivanova Soskova:
The Incomputable: Journeys Beyond the Turing Barrier. Theory and Applications of Computability, Springer International Publishing 2017, ISBN 978-3-319-43667-8 [contents] - 2016
- [j58]Charles M. Harris, Kyung Il Lee, S. Barry Cooper:
Automorphisms of η-like computable linear orderings and Kierstead's conjecture. Math. Log. Q. 62(6): 481-506 (2016) - [p3]Kanti V. Mardia, S. Barry Cooper:
Alan Turing and Enigmatic Statistics. The Once and Future Turing 2016: 78-89 - [e11]S. Barry Cooper, Andrew Hodges:
The Once and Future Turing: Computing the World. Cambridge University Press 2016, ISBN 9780511863196 [contents] - 2015
- [j57]S. Barry Cooper:
'Real' information is not flat - and why it matters. J. Exp. Theor. Artif. Intell. 27(1): 3-11 (2015) - [j56]S. Barry Cooper:
The machine as data: a computational view of emergence and definability. Synth. 192(7): 1955-1988 (2015) - [i4]S. Barry Cooper:
The Machine as Data: A Computational View of Emergence and Definability. CoRR abs/1506.06270 (2015) - 2014
- [j55]S. Barry Cooper, Anuj Dawar
, Martin Hyland, Benedikt Löwe:
Turing Centenary Conference: How the World Computes. Ann. Pure Appl. Log. 165(9): 1353-1354 (2014) - [j54]George Barmpalias, Manindra Agrawal, S. Barry Cooper:
Theory and Applications of Models of Computation at the Turing Centenary in China. Theor. Comput. Sci. 560: 107 (2014) - [c11]T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper:
A Roadmap for TAMC. TAMC 2014: 1-6 - [e10]T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper:
Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8402, Springer 2014, ISBN 978-3-319-06088-0 [contents] - 2013
- [j53]S. Barry Cooper, Vincent Danos:
Editorial. Int. J. Softw. Informatics 7(4): 483-484 (2013) - [j52]S. Barry Cooper, Mariya Ivanova Soskova:
The incomputable. J. Log. Comput. 23(6): 1143-1144 (2013) - [j51]S. Barry Cooper, Elham Kashefi, Prakash Panangaden:
Preface to special issue: Developments In Computational Models 2010. Math. Struct. Comput. Sci. 23(2): 201-203 (2013) - [i3]S. Barry Cooper:
What Makes a Computation Unconventional? CoRR abs/1303.2507 (2013) - [i2]S. Barry Cooper:
The Mathematician's Bias - and the Return to Embodied Computation. CoRR abs/1304.5385 (2013) - [i1]S. Barry Cooper:
Incomputability after Alan Turing. CoRR abs/1304.6363 (2013) - 2012
- [j50]S. Barry Cooper:
Turing's Titanic machine? Commun. ACM 55(3): 74-83 (2012) - [j49]Vasco Brattka, Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Elvira Mayordomo:
Editorial. Comput. 1(1): 1-2 (2012) - [j48]Alexandra A. Soskova, S. Barry Cooper, Andrea Sorbi:
Computability at Logic Colloquium 2009. J. Log. Comput. 22(4): 667 (2012) - [j47]Cristian S. Calude, S. Barry Cooper:
Introduction: computability of the physical. Math. Struct. Comput. Sci. 22(5): 723-728 (2012) - [j46]S. Barry Cooper:
Turing centenary: The incomputable reality. Nat. 482(7386): 465 (2012) - [c10]S. Barry Cooper:
Mathematics, Metaphysics and the Multiverse. Computation, Physics and Beyond 2012: 252-267 - [c9]S. Barry Cooper:
From Turing Machine to Morphogenesis: Forming and Informing Computation. TAMC 2012: 3-10 - [e9]S. Barry Cooper, Anuj Dawar, Benedikt Löwe:
How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings. Lecture Notes in Computer Science 7318, Springer 2012, ISBN 978-3-642-30869-7 [contents] - [e8]Manindra Agrawal, S. Barry Cooper, Angsheng Li:
Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings. Lecture Notes in Computer Science 7287, Springer 2012, ISBN 978-3-642-29951-3 [contents] - 2011
- [j45]Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Splitting and nonsplitting in the Σ20 enumeration degrees. Theor. Comput. Sci. 412(18): 1669-1685 (2011) - [j44]Jianer Chen, S. Barry Cooper:
Algorithms, complexity and computational models. Theor. Comput. Sci. 412(23): 2457-2458 (2011) - 2010
- [j43]S. Barry Cooper:
Extending and interpreting Post's programme. Ann. Pure Appl. Log. 161(6): 775-788 (2010) - [j42]S. Barry Cooper:
The Computational Roots of Hyper-Causality? Int. J. Unconv. Comput. 6(5): 437-449 (2010) - [j41]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): 705-706 (2010) - [e7]S. Barry Cooper, Prakash Panangaden, Elham Kashefi:
Proceedings Sixth Workshop on Developments in Computational Models: Causality, Computation, and Physics, DCM 2010, Edinburgh, Scotland, 9-10th July 2010. EPTCS 26, 2010 [contents]
2000 – 2009
- 2009
- [j40]S. Barry Cooper:
Emergence as a computability-theoretic phenomenon. Appl. Math. Comput. 215(4): 1351-1360 (2009) - [j39]Samuel R. Buss, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi:
Preface. Ann. Pure Appl. Log. 160(3): 229-230 (2009) - [j38]S. Barry Cooper, Benedikt Löwe, Andrea Sorbi:
Logic and Computation in the Real World: CiE 2007. J. Log. Comput. 19(1): 1-2 (2009) - [j37]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): 5-7 (2009) - [j36]S. Barry Cooper, Elvira Mayordomo, Andrea Sorbi:
Computation and Logic in the Real World: CiE 2007. Theory Comput. Syst. 45(4): 647-649 (2009) - [j35]Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi:
Foreword. Theor. Comput. Sci. 410(4-5): 283-284 (2009) - [j34]S. Barry Cooper, Hong Zhu:
Preface: Algorithms, complexity and models of computation. Theor. Comput. Sci. 410(11): 1001-1002 (2009) - [c8]S. Barry Cooper:
The Extended Turing Model as Contextual Tool. TAMC 2009: 18-28 - [e6]Jianer Chen, S. Barry Cooper:
Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings. Lecture Notes in Computer Science 5532, Springer 2009, ISBN 978-3-642-02016-2 [contents] - [e5]S. Barry Cooper, Vincent Danos:
Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature, DCM 2009, Rhodes, Greece, 11th July 2009. EPTCS 9, 2009 [contents] - 2008
- [j33]S. Barry Cooper, Angsheng Li:
On Lachlan's major sub-degree problem. Arch. Math. Log. 47(4): 341-434 (2008) - [j32]S. Barry Cooper, Herman Geuvers, Anand Pillay, Jouko A. Väänänen:
Preface. Ann. Pure Appl. Log. 156(1): 1-2 (2008) - [j31]S. Barry Cooper, Mariya Ivanova Soskova:
How enumeration reducibility yields extended Harrington non-splitting. J. Symb. Log. 73(2): 634-655 (2008) - [c7]Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Total Degrees and Nonsplitting Properties of Enumeration Degrees. TAMC 2008: 568-578 - [c6]S. Barry Cooper, Matthew C. Salts, Guohua Wu:
The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees. TAMC 2008: 588-596 - [p2]S. Barry Cooper:
Computability. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [j30]Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan:
Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17(6): 1025-1040 (2007) - [j29]S. Barry Cooper, Benedikt Löwe, Peter van Emde Boas:
Theory of Computation at CiE 2005. Theory Comput. Syst. 41(1): 1-2 (2007) - [j28]S. Barry Cooper, Angsheng Li:
Preface: Theory and applications of models of computation. Theor. Comput. Sci. 384(1): 1 (2007) - [c5]Mariya Ivanova Soskova, S. Barry Cooper:
The Strongest Nonsplitting Theorem. TAMC 2007: 199-211 - [e4]S. Barry Cooper, Benedikt Löwe, Andrea Sorbi:
Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings. Lecture Notes in Computer Science 4497, Springer 2007, ISBN 978-3-540-73000-2 [contents] - [e3]Jin-yi Cai, S. Barry Cooper, Hong Zhu:
Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings. Lecture Notes in Computer Science 4484, Springer 2007, ISBN 978-3-540-72503-9 [contents] - 2006
- [j27]S. Barry Cooper:
Definability as hypercomputational effect. Appl. Math. Comput. 178(1): 72-82 (2006) - [j26]S. Barry Cooper, Benedikt Löwe, Dag Normann:
Mathematics of computing at CiE 2005. Math. Struct. Comput. Sci. 16(5): 735-736 (2006) - [c4]S. Barry Cooper:
How Can Nature Help Us Compute? SOFSEM 2006: 1-13 - [c3]Bahareh Afshari, George Barmpalias, S. Barry Cooper:
Immunity Properties and the n-C.E. Hierarchy. TAMC 2006: 694-703 - [e2]Jin-yi Cai, S. Barry Cooper, Angsheng Li:
Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings. Lecture Notes in Computer Science 3959, Springer 2006, ISBN 3-540-34021-1 [contents] - 2005
- [j25]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): 159-175 (2005) - [j24]S. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang:
Bounding and nonbounding minimal pairs in the enumeration degrees. J. Symb. Log. 70(3): 741-766 (2005) - [j23]S. Barry Cooper, Andrew E. M. Lewis, Yue Yang:
Properly Sigma2 minimal degrees and 0'' complementation. Math. Log. Q. 51(3): 274-276 (2005) - [c2]S. Barry Cooper:
Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It. CiE 2005: 1-7 - [e1]S. Barry Cooper, Benedikt Löwe, Leen Torenvliet:
New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings. Lecture Notes in Computer Science 3526, Springer 2005, ISBN 3-540-26179-6 [contents] - 2004
- [b2]S. Barry Cooper:
Computability theory. Chapman and Hall / CRC mathematics texts, Chapman & Hall 2004, ISBN 978-1-58488-237-4, pp. I-IX, 1-409 - [j22]Marat M. Arslanov, S. Barry Cooper, Angsheng Li:
There is no low maximal d. c. e. degree - Corrigendum. Math. Log. Q. 50(6): 628-636 (2004) - 2003
- [b1]S. Barry Cooper, Sergey S. Goncharov:
Computability and models - perspectives east and west. The University series in mathematics, Springer 2003, ISBN 978-0-306-47400-2, pp. I-XVIII, 1-375 - 2002
- [j21]S. Barry Cooper, Angsheng Li, Xiaoding Yi:
On the distribution of Lachlan nonsplitting bases. Arch. Math. Log. 41(5): 455-482 (2002) - [j20]S. Barry Cooper, Angsheng Li:
Splitting and Nonsplitting, II: A Low2 C.E. Degree above Which 0' Is Not Splittable. J. Symb. Log. 67(4): 1391-1430 (2002) - 2001
- [j19]S. Barry Cooper:
On a Conjecture of Kleene and Post. Math. Log. Q. 47(1): 3-33 (2001) - 2000
- [j18]Marat M. Arslanov, S. Barry Cooper, Angsheng Li:
There is No Low Maximal D.C.E. Degree. Math. Log. Q. 46(3): 409-416 (2000)
1990 – 1999
- 1999
- [p1]S. Barry Cooper:
Local Degree Theory. Handbook of Computability Theory 1999: 121-153 - 1996
- [j17]S. Barry Cooper, Andrea Sorbi, Xiaoding Yi:
Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets. Ann. Pure Appl. Log. 82(3): 317-342 (1996) - [j16]S. Barry Cooper, Andrea Sorbi:
Noncappable Enumeration Degrees Below 0'e. J. Symb. Log. 61(4): 1347-1363 (1996) - [j15]S. Barry Cooper:
Strong Minimal Covers for Recursively Enumerable Degrees. Math. Log. Q. 42: 191-196 (1996) - 1995
- [j14]S. Barry Cooper, Xiaoding Yi:
The discontinuity of splitting in the recursively enumerable degrees. Arch. Math. Log. 34(4): 247-256 (1995) - [c1]S. Barry Cooper:
Beyond Gödel's Theorem: Turing Nonrigidity Revisited. Logic Colloquium 1995: 44-50 - 1991
- [j13]S. Barry Cooper:
The density of the low2n-r.e. degrees. Arch. Math. Log. 31(1): 19-24 (1991) - [j12]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): 125-151 (1991)
1980 – 1989
- 1989
- [j11]S. Barry Cooper:
A Jump Class of Noncappable Degrees. J. Symb. Log. 54(2): 324-353 (1989) - [j10]S. Barry Cooper:
The Strong Anticupping Property for Recursively Enumerable Degrees. J. Symb. Log. 54(2): 527-539 (1989) - 1988
- [j9]S. Barry Cooper, C. S. Copestake:
Properly Σ2 Enumeration Degrees. Math. Log. Q. 34(6): 491-522 (1988) - 1987
- [j8]S. Barry Cooper, Richard L. Epstein:
Complementing below recursively enumerable degrees. Ann. Pure Appl. Log. 34(1): 15-32 (1987) - [j7]S. Barry Cooper:
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers. Math. Log. Q. 33(6): 537-560 (1987) - 1985
- [j6]Kevin McEvoy, S. Barry Cooper:
On Minimal Pairs of Enumeration Degrees. J. Symb. Log. 50(4): 983-1001 (1985) - 1984
- [j5]S. Barry Cooper:
Partial Degrees and the Density Problem. Part 2: The Enumeration Degrees of the sigma2 Sets are Dense. J. Symb. Log. 49(2): 503-513 (1984) - 1982
- [j4]S. Barry Cooper:
Partial Degrees and the Density Problem. J. Symb. Log. 47(4): 854-859 (1982)
1970 – 1979
- 1974
- [j3]S. Barry Cooper:
Minimal Pairs and High Recursively Enumerable Degrees. J. Symb. Log. 39(4): 655-660 (1974) - 1973
- [j2]S. Barry Cooper:
Minimal Degrees and the Jump Operator. J. Symb. Log. 38(2): 249-271 (1973) - 1972
- [j1]S. Barry Cooper:
Jump Equivalence of the triangle 02 Hyperhyperimmune Sets. J. Symb. Log. 37(3): 598-600 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
