# Turing machine

## Papers overview

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

Highly Cited

2014

Highly Cited

2014

- ArXiv
- 2014

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

Is this relevant?

Highly Cited

2013

Highly Cited

2013

- CRYPTO
- 2013

Cryptographic schemes for computing on encrypted data promise to be a fundamental building block of cryptography. The way one… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- 2004

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

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- 2001

The importance of algorithms is now recognized in all mathematical sciences, thanks to the development of computability and… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Minds and Machines
- 2000

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

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- DNA Based Computers
- 1995

Bacteria employ restriction enzymes to cut or restrict DNA at or near specific words in a unique way. Many restriction enzymes… (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- 1991

This paper shows the existence of a finite neural network, made up of sigmoidal nenrons, which simulates a nniversal Turing… (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- STOC
- 1978

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

Is this relevant?

Highly Cited

1966

Highly Cited

1966

- Commun. ACM
- 1966

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

Is this relevant?

Highly Cited

1966

Highly Cited

1966

- J. ACM
- 1966

It has long been known that increasing the number of tapes used by a Turing machine does not provide the ability to compute any… (More)

Is this relevant?