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)

Related topics

Related topics

36 relations
Alternating Turing machineAverage-case complexityBook embeddingBreadth-first search

Broader (1)

Turing machine

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Ntccrt: A Concurrent Constraint Framework for Real-Time Interaction
Writing multimedia interaction systems is not easy. Their concurrent processes usually access shared resources in a non… 
2014
2014
ADMM decoding of non-binary LDPC codes in F2m
In this paper, we develop an efficient algorithm for linear programming (LP) decoding of non-binary low-density parity-check… 
2013
2013
Cut-free sequent calculi for C-systems with generalized finite-valued semantics
In the paper Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics by A. Avron, J. Ben-Naim… 
2006
2006
Galileo-GPS RAIM for Vertical Guidance
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
Estimation of tire cornering stiffness using GPS to improve model based estimation of vehicle states
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
Long sustainment of quasi-steady-state high βp H mode discharges in JT-60U
Quasi-steady-state high βp H mode discharges performed by suppressing neoclassical tearing modes (NTMs) are described. Two… 
2001
2001
Non-deterministic diagnosis of end-to-end service failures in a multi-layer communication system
Fault localization is a process of isolating faults responsible for the observable malfunctioning of the managed system… 
1997
1997
Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability
  • L. Fortnow
  • Proceedings of Computational Complexity. Twelfth…
  • 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
A survey on counting classes
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
Highly Cited
1984
Microcanonical simulation of Ising systems
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)