Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Writing multimedia interaction systems is not easy. Their concurrent processes usually access shared resources in a non… 
2014
2014
In this paper, we develop an efficient algorithm for linear programming (LP) decoding of non-binary low-density parity-check… 
2013
2013
In the paper Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics by A. Avron, J. Ben-Naim… 
2006
2006
In the next ten years the number of pseudorange sources and their quality is expected to increase dramatically: The United States… 
Highly Cited
2005
Highly Cited
2005
This paper demonstrates a method of obtaining key vehicle states using GPS and INS measurements with an adaptive model based… 
Highly Cited
2001
Highly Cited
2001
Quasi-steady-state high βp H mode discharges performed by suppressing neoclassical tearing modes (NTMs) are described. Two… 
2001
2001
Fault localization is a process of isolating faults responsible for the observable malfunctioning of the managed system… 
1997
1997
  • L. Fortnow
  • 1997
  • Corpus ID: 24157619
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved… 
Review
1990
Review
1990
Consideration is given to polynomial-time machines. Among these classes are EP and PP. The authors prove P/sup EP(log)/ 25 PP… 
Highly Cited
1984