Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

In the Simply Typed $\lambda$-calculus Statman investigates the reducibility relation $\leq_{\beta\eta}$ between types: for $A,B… Expand

Is this relevant?

2008

2008

We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence… Expand

Is this relevant?

2005

2005

Abstract.A strong reducibility relation between partial numberings is introduced which is such that the reduction function… Expand

Is this relevant?

2004

2004

Decidability problems for (fragments of) the theory of the structure D of Turing degrees, form a wide and interesting class, much… Expand

Is this relevant?

Highly Cited

1991

Highly Cited

1991

Failure Detectors for Asynchronous Systems* (Preliminary Version) Tushar Deepak Chandra and Sam Toueg Department of Computer… Expand

Is this relevant?

1990

1990

Recursion theory deals with computability on the natural numbers. A function ƒ from N to N is computable (or recursive) if it can… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

We show that, for any set A which cannot be computed in polynomial time, the class of sets p-many-one incomparable with A has… Expand

Is this relevant?

1984

1984

In this paper, we investigate the quotient semilattice R/M of the r.e. degrees modulo the cappable degrees. We first prove the R… Expand

Is this relevant?

Highly Cited

1974

Highly Cited

1974

We define polynomial time computable operator. Our definition generalizes Cook's definition to arbitrary function inputs… Expand

Is this relevant?

1973

1973

Several of the results that appear in [4] are stated to be true of polynominal time reducibility (≤p) but are not proved… Expand

Is this relevant?