Skip to search formSkip to main contentSkip to account menu>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.

2007

2007

In 1973, Parikh proved a speed-up theorem conjectured by Godel 37 years before: there exist arithmetical formulae that are…

2006

2006

It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many…

Highly Cited

2002

Highly Cited

2002

An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p…

1997

1997

With the expanding role of computers in society, some assumptions underlying well known theorems in the theory of parallel…

1991

1991

Path dissolution is an efficient generalization of the method of analytic tableaux. Both methods feature (in the propositional…

1987

1987

In the mid-sixties BLUM [2] announced his speed-up theorem, which affirmed the existence of recursive sets having, in some sense…

Highly Cited

1985

Highly Cited

1985

1974

1974

A deterministic sequential device receives one input symbol at a time, prints output symbols from left to right on an output tape…

1973

1973

Perhaps the two most basic phenomena discovered by the recent application of recursion theoretic methods to the developing…

1970

1970

We study the effect of program structure on computational efficiency in a class of abstract languages which model actual high…