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.

Highly Cited

2014

Highly Cited

2014

We extend the capabilities of neural networks by coupling them to external memory resources, which they can interact with by… Expand

Highly Cited

2004

Highly Cited

2004

Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they… Expand

Highly Cited

1983

Highly Cited

1983

Abstract Cellular automata are discrete dynamical systems with simple construction but complex self-organizing behaviour… Expand

Highly Cited

1982

Highly Cited

1982

Quantum mechanical Hamiltonian models, which represent an aribtrary but finite number of steps of any Turing machine computation… Expand

Highly Cited

1978

Highly Cited

1978

A model of computation based on random access machines operating in parallel and sharing a common memory is presented. The… Expand

Highly Cited

1978

Highly Cited

1978

The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand

Highly Cited

1976

Highly Cited

1976

Computer science is the study of the phenomena surrounding computers. The founders of this society understood this very well when… Expand

Highly Cited

1966

Highly Cited

1966

In the first part of the paper, flow diagrams are introduced to represent inter ah mappings of a set into itself. Although not… Expand

Highly Cited

1965

Highly Cited

1965

This paper has two purposes. The first is to investigate the characteristics of a restricted class of Turing machines, and to… Expand

Highly Cited

1961

Highly Cited

1961

The equivalence of the notions of effective computability as based (1) on formal systems (e.g., those of Post), and (2) on… Expand