Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A major problem for kernel-based predictors (such as Support Vector Machines and Gaussian processes) is that the amount of… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
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
  • figure 1
  • figure 2
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… Expand
Is this relevant?
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
Is this relevant?
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
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… Expand
  • figure 4
  • figure 15
  • figure 19
  • figure 18
  • figure 16
Is this relevant?
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
Is this relevant?