Turing machine

Known as: Universal computing machine, Deterministic Turing machine, The Turing Machine 
A Turing machine is an abstract machine that manipulates symbols on a strip of tape according to a table of rules; to be more exact, it is a… (More)
Wikipedia

Papers overview

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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
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
Quantum mechanical Hamiltonian models, which represent an aribtrary but finite number of steps of any Turing machine computation… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
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
Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1995
Highly Cited
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
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
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
In the first part of the paper, flow diagrams are introduced to represent inter ah mappings of a set into itself. Although not… (More)
  • figure 4
  • figure 15
  • figure 19
  • figure 18
  • figure 16
Is this relevant?
Highly Cited
1966
Highly Cited
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?