Non-deterministic Turing machine

Known as: Nondeterministic computation, Nondeterministic Turing machine, Nondeterministic Turing machines 
In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper we extend neural Turing machine (NTM) into a dynamic neural Turing machine (D-NTM) by introducing a trainable… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2015
Highly Cited
2015
The expressive power of a machine learning model is closely r elated to the number of sequential computational steps it can learn… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
The Neural Turing Machine (NTM) is more expressive than all previously considered models because of its external memory. It can… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Neural Machine Translation (NMT) has recently attracted a l ot of attention due to the very high performance achieved by deep… (More)
  • table 1
  • table 2
  • figure 5
  • figure 7
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We demonstrate that many known algorithms for model checking in nite-state systems can be derived uniformly from a reachability… (More)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Interpretation of Reactive Systems DENNIS DAMS and ROB GERTH Eindhoven University of Technology and ORNA GRUMBERG Technion, Haifa… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
These chunks correspond in some way to prosodic patterns. It appears, for instance, that the strongest stresses in the sentence… (More)
Is this relevant?
1985
1985
It is shown that a bounded language accepted by a nondeterministic Turing machine in spaceS(n ∈o(logn) can be accepted by a… (More)
Is this relevant?
Highly Cited
1970
Highly Cited
1970
This paper first proves the Savitch Theorem: any nondeterminstic L(n)− tape bounded Turing Machine can be simulated by a… (More)
Is this relevant?
1969
1969
Computations of non-deterministic Turing machines are shown to correspond to “solving” certain mazes. The storage needed to… (More)
Is this relevant?