Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
S. Barry Cooper
2010 – today
- 2013
[j46]S. Barry Cooper, Elham Kashefi, Prakash Panangaden: Preface to special issue: Developments In Computational Models 2010. Mathematical Structures in Computer Science 23(2): 201-203 (2013)
[i3]
[i2]S. Barry Cooper: The Mathematician's Bias - and the Return to Embodied Computation. CoRR abs/1304.5385 (2013)
[i1]- 2012
[j45]
[j44]Vasco Brattka, Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Elvira Mayordomo: Editorial. Computability 1(1): 1-2 (2012)
[j43]Alexandra Soskova, S. Barry Cooper, Andrea Sorbi: Computability at Logic Colloquium 2009. J. Log. Comput. 22(4): 667 (2012)
[j42]Cristian S. Calude, S. Barry Cooper: Introduction: computability of the physical. Mathematical Structures in Computer Science 22(5): 723-728 (2012)
[c9]S. Barry Cooper: Mathematics, Metaphysics and the Multiverse. Computation, Physics and Beyond 2012: 252-267
[c8]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 (Eds.): 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
[e8]Manindra Agrawal, S. Barry Cooper, Angsheng Li (Eds.): 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- 2011
[j41]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)
[j40]Jianer Chen, S. Barry Cooper: Algorithms, complexity and computational models. Theor. Comput. Sci. 412(23): 2457-2458 (2011)- 2010
[j39]S. Barry Cooper: Extending and interpreting Post's programme. Ann. Pure Appl. Logic 161(6): 775-788 (2010)
[j38]
[j37]Manindra Agrawal, S. Barry Cooper, Angsheng Li: Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009). Mathematical Structures in Computer Science 20(5): 705-706 (2010)
[e7]S. Barry Cooper, Prakash Panangaden, Elham Kashefi (Eds.): Proceedings Sixth Workshop on Developments in Computational Models: Causality, Computation, and Physics. EPTCS 26, 2010
2000 – 2009
- 2009
[j36]S. Barry Cooper: Emergence as a computability-theoretic phenomenon. Applied Mathematics and Computation 215(4): 1351-1360 (2009)
[j35]Samuel R. Buss, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi: Preface. Ann. Pure Appl. Logic 160(3): 229-230 (2009)
[j34]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)
[j33]Jin-yi Cai, S. Barry Cooper, Angsheng Li: Preface to Special Issue: Theory and Applications of Models of Computation (TAMC). Mathematical Structures in Computer Science 19(1): 5-7 (2009)
[j32]S. Barry Cooper, Elvira Mayordomo, Andrea Sorbi: Computation and Logic in the Real World: CiE 2007. Theory Comput. Syst. 45(4): 647-649 (2009)
[j31]Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi: Foreword. Theor. Comput. Sci. 410(4-5): 283-284 (2009)
[j30]S. Barry Cooper, Hong Zhu: Preface: Algorithms, complexity and models of computation. Theor. Comput. Sci. 410(11): 1001-1002 (2009)
[c7]
[e6]Jianer Chen, S. Barry Cooper (Eds.): 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
[e5]S. Barry Cooper, Vincent Danos (Eds.): Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature. EPTCS 9, 2009- 2008
[j29]S. Barry Cooper, Angsheng Li: On Lachlan's major sub-degree problem. Arch. Math. Log. 47(4): 341-434 (2008)
[j28]S. Barry Cooper, Herman Geuvers, Anand Pillay, Jouko A. Väänänen: Preface. Ann. Pure Appl. Logic 156(1): 1-2 (2008)
[j27]S. Barry Cooper, Mariya Ivanova Soskova: How enumeration reducibility yields extended Harrington non-splitting. J. Symb. Log. 73(2): 634-655 (2008)
[c6]Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova: Total Degrees and Nonsplitting Properties of Enumeration Degrees. TAMC 2008: 568-578
[c5]S. Barry Cooper, Matthew C. Salts, Guohua Wu: The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees. TAMC 2008: 588-596
[p1]- 2007
[j26]Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan: Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17(6): 1025-1040 (2007)
[j25]S. Barry Cooper, Benedikt Löwe, Peter van Emde Boas: Theory of Computation at CiE 2005. Theory Comput. Syst. 41(1): 1-2 (2007)
[j24]S. Barry Cooper, Angsheng Li: Preface: Theory and applications of models of computation. Theor. Comput. Sci. 384(1): 1 (2007)
[c4]
[e4]S. Barry Cooper, Benedikt Löwe, Andrea Sorbi (Eds.): 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
[e3]Jin-yi Cai, S. Barry Cooper, Hong Zhu (Eds.): 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- 2006
[j23]S. Barry Cooper: Definability as hypercomputational effect. Applied Mathematics and Computation 178(1): 72-82 (2006)
[j22]S. Barry Cooper, Benedikt Löwe, Dag Normann: Mathematics of computing at CiE 2005. Mathematical Structures in Computer Science 16(5): 735-736 (2006)
[c3]
[c2]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 (Eds.): 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- 2005
[j21]Marat M. Arslanov, Chi Tat Chong, S. Barry Cooper, Yue Yang: The minimal e-degree problem in fragments of Peano arithmetic. Ann. Pure Appl. Logic 131(1-3): 159-175 (2005)
[j20]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)
[j19]S. Barry Cooper, Andrew E. M. Lewis, Yue Yang: Properly Sigma2 minimal degrees and 0'' complementation. Math. Log. Q. 51(3): 274-276 (2005)
[c1]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 (Eds.): 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- 2004
[j18]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)- 2002
[j17]S. Barry Cooper, Angsheng Li, Xiaoding Yi: On the distribution of Lachlan nonsplitting bases. Arch. Math. Log. 41(5): 455-482 (2002)
[j16]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
[j15]- 2000
[j14]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
- 1996
[j13]S. Barry Cooper, Andrea Sorbi, Xiaoding Yi: Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets. Ann. Pure Appl. Logic 82(3): 317-342 (1996)
[j12]S. Barry Cooper, Andrea Sorbi: Noncappable Enumeration Degrees Below 0'e. J. Symb. Log. 61(4): 1347-1363 (1996)
[j11]S. Barry Cooper: Strong Minimal Covers for Recursively Enumerableg. Math. Log. Q. 42: 191-196 (1996)- 1995
[j10]S. Barry Cooper, Xiaoding Yi: The discontinuity of splitting in the recursively enumerable degrees. Arch. Math. Log. 34(4): 247-256 (1995)- 1991
[j9]S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare: The d.r.e. Degrees are Not Dense. Ann. Pure Appl. Logic 55(2): 125-151 (1991)
1980 – 1989
- 1989
[j8]
[j7]S. Barry Cooper: The Strong Anticupping Property for Recursively Enumerable Degrees. J. Symb. Log. 54(2): 527-539 (1989)- 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]
1970 – 1979
- 1974
[j3]S. Barry Cooper: Minimal Pairs and High Recursively Enumerable Degrees. J. Symb. Log. 39(4): 655-660 (1974)- 1973
[j2]- 1972
[j1]S. Barry Cooper: Jump Equivalence of the triangle 02 Hyperhyperimmune Sets. J. Symb. Log. 37(3): 598-600 (1972)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:55 CEST by the dblp team



