#### Filter Results:

- Full text PDF available (57)

#### Publication Year

1972

2016

- This year (0)
- Last 5 years (22)
- Last 10 years (53)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- S. Barry Cooper
- 1990

In a computation using auxiliary informational inputs one can think of the external resource making itself available in different ways. One way is via an oracle as in Turing reducibility, where information is supplied on demand without any time delay. Alternatively the Scott graph model for lambda calculus suggests a situation where new information, only… (More)

- S. Barry Cooper
- J. Symb. Log.
- 1982

- Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan
- J. Log. Comput.
- 2007

This paper extends Post's programme to finite levels of the Ershov hierarchy of ∆2 sets. Our initial characterisation, in the spirit of Post [27], of the degrees of the immune and hyperimmune n-enumerable sets leads to a number of results setting other immunity properties in the context of the Turing and wtt-degrees derived from the Ershov hierarchy. For… (More)

- S. Barry Cooper
- J. Symb. Log.
- 1973

- Kevin McEvoy, S. Barry Cooper
- J. Symb. Log.
- 1985

- S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
- Ann. Pure Appl. Logic
- 1991

- S. Barry Cooper
- Applied Mathematics and Computation
- 2006

The classical simulation of physical processes using standard models of computation is fraught with problems. On the other hand, attempts at modelling real-world computation with the aim of isolating its hypercomputational content have struggled to convince. We argue that a better basic understanding can be achieved through computability theoretic… (More)

- S. Barry Cooper
- Math. Log. Q.
- 1987

- Marat M. Arslanov, S. Barry Cooper, Angsheng Li
- Math. Log. Q.
- 2000

We show that for any computably enumerable (c.e.) degree a and any low n–c.e. degree l (n ≥ 1), if l < a, then there are n–c.e. degrees a 0 , a 1 such that l < a 0 , a 1 < a and a 0 ∨ a 1 = a. In particular, there is no low maximal d.c.e. degree.

- S. Barry Cooper
- Arch. Math. Log.
- 1991

Although density fails in the d-recursively enumerable (d-r.e.) degrees, and more generally in the n-r.e. degrees (see [3]), we show below that the low 2 n-r.e. degrees are dense. This is achieved by combining density and splitting in the manner of Harrington's proof (see [9]) for the r.e. (=1-r.e.) case. As usual we use low 2-ness to eliminate infinite… (More)