S. Barry Cooper - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'S. Barry Cooper' as author, editor, or advisor:

On a Conjecture of Kleene and PostS. Barry Cooper. mlq, 47(1):3-33, 2001. [doi]
Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. ProceedingsJianer Chen, S. Barry Cooper, editors, Volume 5532 of Lecture Notes in Computer Science, Springer, 2009. [doi]
On Minimal Pairs of Enumeration DegreesKevin McEvoy, S. Barry Cooper. JSYML, 50(4):983-1001, 1985.
Computation and Logic in the Real World: CiE 2007S. Barry Cooper, Elvira Mayordomo, Andrea Sorbi. mst, 45(4):647-649, 2009. [doi]
Strong Minimal Covers for Recursively EnumerablegS. Barry Cooper. mlq, 42:191-196, 1996.
Enumeration Reducibility Using Bounded Information: Counting Minimal CoversS. Barry Cooper. mlq, 33(6):537-560, 1987. [doi]
Introduction: computability of the physicalCristian S. Calude, S. Barry Cooper. mscs, 22(5):723-728, 2012. [doi]
On the distribution of Lachlan nonsplitting basesS. Barry Cooper, Angsheng Li, Xiaoding Yi. AML, 41(5):455-482, 2002. [doi]
The Strongest Nonsplitting TheoremMariya Ivanova Soskova, S. Barry Cooper. tamc 2007: 199-211 [doi]
Logic and Computation in the Real World: CiE 2007S. Barry Cooper, Benedikt Löwe, Andrea Sorbi. logcom, 19(1):1-2, 2009. [doi]
Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. ProceedingsT. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper, editors, Volume 8402 of Lecture Notes in Computer Science, Springer, 2014. [doi]
Minimal Pairs and High Recursively Enumerable DegreesS. Barry Cooper. JSYML, 39(4):655-660, 1974.
The machine as data: a computational view of emergence and definabilityS. Barry Cooper. synthese, 192(7):1955-1988, 2015. [doi]
Alan Turing and Enigmatic StatisticsKanti V. Mardia, S. Barry Cooper. In S. Barry Cooper, Andrew Hodges, editors, The Once and Future Turing: Computing the World. pages 78-89, Cambridge University Press, 2016. [doi]
2 Enumeration DegreesS. Barry Cooper, C. S. Copestake. mlq, 34(6):491-522, 1988. [doi]
Splitting and Nonsplitting, II: A Low::2:: C.E. Degree above Which 0 Is Not SplittableS. Barry Cooper, Angsheng Li. JSYML, 67(4):1391-1430, 2002.
Turing Centenary Conference: How the World ComputesS. Barry Cooper, Anuj Dawar, Martin Hyland, Benedikt Löwe. APAL, 165(9):1353-1354, 2014. [doi]
A Jump Class of Noncappable DegreesS. Barry Cooper. JSYML, 54(2):324-353, 1989.
A Roadmap for TAMCT. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper. tamc 2014: 1-6 [doi]
Linearisations and the Ershov hierarchyS. Barry Cooper, James Gay, Charles M. Harris, Kyung-Il Lee, Anthony Morphett. computability, 7(2-3):143-169, 2018. [doi]
EditorialVasco Brattka, Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Elvira Mayordomo. computability, 1(1):1-2, 2012. [doi]
Post s Programme for the Ershov HierarchyBahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan. logcom, 17(6):1025-1040, 2007. [doi]
The d.r.e. Degrees are Not DenseS. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare. APAL, 55(2):125-151, 1991.
Theory and Applications of Models of Computation at the Turing Centenary in ChinaGeorge Barmpalias, Manindra Agrawal, S. Barry Cooper. TCS, 560:107, 2014. [doi]
Computability theoryS. Barry Cooper. Chapman and Hall / CRC mathematics texts, Chapman & Hall, 2004.
PrefaceS. Barry Cooper, Herman Geuvers, Anand Pillay, Jouko A. Väänänen. APAL, 156(1):1-2, 2008. [doi]
Computability and models - perspectives east and westS. Barry Cooper, Sergey S. Goncharov. The University series in mathematics, Springer, 2003.
Turing centenary: The incomputable realityS. Barry Cooper. nature, 482(7386):465, 2012. [doi]
Complementing below recursively enumerable degreesS. Barry Cooper, Richard L. Epstein. APAL, 34(1):15-32, 1987. [doi]
Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare. APAL, 168(12):2164-2165, 2017. [doi]
n-r.e. degreesS. Barry Cooper. AML, 31(1):19-24, 1991. [doi]
Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent ItS. Barry Cooper. cie 2005: 1-7 [doi]
The Once and Future Turing: Computing the WorldS. Barry Cooper, Andrew Hodges, editors, Cambridge University Press, 2016. [doi]
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC)Jin-yi Cai, S. Barry Cooper, Angsheng Li. mscs, 19(1):5-7, 2009. [doi]
Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, ProceedingsJin-yi Cai, S. Barry Cooper, Angsheng Li, editors, Volume 3959 of Lecture Notes in Computer Science, Springer, 2006.
Turing's Titanic machine?S. Barry Cooper. CACM, 55(3):74-83, 2012. [doi]
The minimal e-degree problem in fragments of Peano arithmeticMarat M. Arslanov, Chi Tat Chong, S. Barry Cooper, Yue Yang. APAL, 131(1-3):159-175, 2005. [doi]
Properly Sigma::2:: minimal degrees and 0 complementationS. Barry Cooper, Andrew E. M. Lewis, Yue Yang. mlq, 51(3):274-276, 2005. [doi]
The discontinuity of splitting in the recursively enumerable degreesS. Barry Cooper, Xiaoding Yi. AML, 34(4):247-256, 1995. [doi]
Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, ProceedingsS. Barry Cooper, Benedikt Löwe, Andrea Sorbi, editors, Volume 4497 of Lecture Notes in Computer Science, Springer, 2007.
How Can Nature Help Us Compute?S. Barry Cooper. sofsem 2006: 1-13 [doi]
Theory of Computation at CiE 2005S. Barry Cooper, Benedikt Löwe, Peter van Emde Boas. mst, 41(1):1-2, 2007. [doi]
Partial Degrees and the Density ProblemS. Barry Cooper. JSYML, 47(4):854-859, 1982.
New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, ProceedingsS. Barry Cooper, Benedikt Löwe, Leen Torenvliet, editors, Volume 3526 of Lecture Notes in Computer Science, Springer, 2005.
The incomputableS. Barry Cooper, Mariya Ivanova Soskova. logcom, 23(6):1143-1144, 2013. [doi]
Preface to special issue: Developments In Computational Models 2010S. Barry Cooper, Elham Kashefi, Prakash Panangaden. mscs, 23(2):201-203, 2013. [doi]
Mathematics, Metaphysics and the MultiverseS. Barry Cooper. BIRTHDAY 2012: 252-267 [doi]
Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, ProceedingsJin-yi Cai, S. Barry Cooper, Hong Zhu, editors, Volume 4484 of Lecture Notes in Computer Science, Springer, 2007.
PrefaceSamuel R. Buss, S. Barry Cooper, Benedikt LÃ¶we, Andrea Sorbi. APAL, 160(3):229-230, 2009. [doi]
There is no low maximal d. c. e. degree - CorrigendumMarat M. Arslanov, S. Barry Cooper, Angsheng Li. mlq, 50(6):628-636, 2004. [doi]
Splitting and nonsplitting in the Σ::2:::::0::: enumeration degreesMarat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova. TCS, 412(18):1669-1685, 2011. [doi]
Extending and interpreting Post s programmeS. Barry Cooper. APAL, 161(6):775-788, 2010. [doi]
Local Degree TheoryS. Barry Cooper. In Edward R. Griffor, editor, Handbook of Computability Theory. Volume 140 of Studies in Logic and the Foundations of Mathematics, pages 121-153, North-Holland, 1999. [doi]
Jump Equivalence of the triangle :::0:::::2:: Hyperhyperimmune SetsS. Barry Cooper. JSYML, 37(3):598-600, 1972.
EditorialS. Barry Cooper, Vincent Danos. ijsi, 7(4):483-484, 2013. [doi]
There is No Low Maximal D.C.E. DegreeMarat M. Arslanov, S. Barry Cooper, Angsheng Li. mlq, 46(3):409-416, 2000. [doi]
The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable DegreesS. Barry Cooper, Matthew C. Salts, Guohua Wu. tamc 2008: 588-596 [doi]
The Incomputable: Journeys Beyond the Turing BarrierS. Barry Cooper, Mariya Ivanova Soskova, editors, Springer International Publishing, 2017. [doi]
Preface: Theory and applications of models of computationS. Barry Cooper, Angsheng Li. TCS, 384(1):1, 2007. [doi]
How enumeration reducibility yields extended Harrington non-splittingS. Barry Cooper, Mariya Ivanova Soskova. JSYML, 73(2):634-655, 2008. [doi]
Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. ProceedingsManindra Agrawal, S. Barry Cooper, Angsheng Li, editors, Volume 7287 of Lecture Notes in Computer Science, Springer, 2012. [doi]
η-like computable linear orderings and Kierstead's conjectureCharles M. Harris, Kyung-Il Lee, S. Barry Cooper. mlq, 62(6):481-506, 2016. [doi]
Noncappable Enumeration Degrees Below 0 ::e::S. Barry Cooper, Andrea Sorbi. JSYML, 61(4):1347-1363, 1996.
ForewordPaola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi. TCS, 410(4-5):283-284, 2009. [doi]
From Turing Machine to Morphogenesis: Forming and Informing ComputationS. Barry Cooper. tamc 2012: 3-10 [doi]
Cupping and Noncupping in the Enumeration Degrees of Sigma::2:::::0::: SetsS. Barry Cooper, Andrea Sorbi, Xiaoding Yi. APAL, 82(3):317-342, 1996.
Algorithms, complexity and computational modelsJianer Chen, S. Barry Cooper. TCS, 412(23):2457-2458, 2011. [doi]
Emergence as a computability-theoretic phenomenonS. Barry Cooper. amc, 215(4):1351-1360, 2009. [doi]
Total Degrees and Nonsplitting Properties of Enumeration DegreesMarat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova. tamc 2008: 568-578 [doi]
'Real' information is not flat - and why it mattersS. Barry Cooper. jetai, 27(1):3-11, 2015. [doi]
Partial Degrees and the Density Problem. Part 2: The Enumeration Degrees of the sigma::2:: Sets are DenseS. Barry Cooper. JSYML, 49(2):503-513, 1984.
The Strong Anticupping Property for Recursively Enumerable DegreesS. Barry Cooper. JSYML, 54(2):527-539, 1989.
Mathematics of computing at CiE 2005S. Barry Cooper, Benedikt Löwe, Dag Normann. mscs, 16(5):735-736, 2006. [doi]
Computability at Logic Colloquium 2009Alexandra Soskova, S. Barry Cooper, Andrea Sorbi. logcom, 22(4):667, 2012. [doi]
The Extended Turing Model as Contextual ToolS. Barry Cooper. tamc 2009: 18-28 [doi]
Beyond Gödel's Theorem: Turing Nonrigidity RevisitedS. Barry Cooper. logicColl 1998: 44-50 [doi]
Definability as hypercomputational effectS. Barry Cooper. amc, 178(1):72-82, 2006. [doi]
Bounding and nonbounding minimal pairs in the enumeration degreesS. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang. JSYML, 70(3):741-766, 2005. [doi]
How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. ProceedingsS. Barry Cooper, Anuj Dawar, Benedikt Löwe, editors, Volume 7318 of Lecture Notes in Computer Science, Springer, 2012. [doi]
Computing with Incomplete Information - The Mathematics of Enumeration and Positive ReducibilitiesS. Barry Cooper, Andrea Sorbi, Mariya Ivanova Soskova. WorldScientific, 2022. [doi]
Immunity Properties and the ::::n::::-C.E. HierarchyBahareh Afshari, George Barmpalias, S. Barry Cooper. tamc 2006: 694-703 [doi]
Minimal Degrees and the Jump OperatorS. Barry Cooper. JSYML, 38(2):249-271, 1973.
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009)Manindra Agrawal, S. Barry Cooper, Angsheng Li. mscs, 20(5):705-706, 2010. [doi]
Preface: Algorithms, complexity and models of computationS. Barry Cooper, Hong Zhu. TCS, 410(11):1001-1002, 2009. [doi]
Establishing social cooperation: The role of hubs and community structureS. Barry Cooper, Andy Lewis-Pye, Angsheng Li, Yicheng Pan. netsci, 6(2):251-264, 2018. [doi]
The Computational Roots of Hyper-Causality?S. Barry Cooper. ijuc, 6(5):437-449, 2010. [doi]
On Lachlan s major sub-degree problemS. Barry Cooper, Angsheng Li. AML, 47(4):341-434, 2008. [doi]

runs on WebDSL