14 relations: Breadth-first search, Christos Papadimitriou, Harry R. Lewis, Many-worlds interpretation, NP-completeness, P versus NP problem, Probabilistic Turing machine, Quantum computing, Quantum superposition, Qubit, Scott Aaronson, Theoretical computer science, Thought experiment, Turing machine.

## Breadth-first search

Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures.

New!!: Non-deterministic Turing machine and Breadth-first search · See more »

## Christos Papadimitriou

Christos Harilaos Papadimitriou (Greek: Χρήστος Χαρίλαος Παπαδημητρίου; born August 16, 1949) is a Greek theoretical computer scientist, and professor of Computer Science at Columbia University.

New!!: Non-deterministic Turing machine and Christos Papadimitriou · See more »

## Harry R. Lewis

Lewis has been honored for his "particularly distinguished contributions to undergraduate teaching"; his students have included future entrepreneurs Bill Gates and Mark Zuckerberg, and numerous future faculty members at Harvard and other schools.

New!!: Non-deterministic Turing machine and Harry R. Lewis · See more »

## Many-worlds interpretation

The many-worlds interpretation is an interpretation of quantum mechanics that asserts the objective reality of the universal wavefunction and denies the actuality of wavefunction collapse.

New!!: Non-deterministic Turing machine and Many-worlds interpretation · See more »

## NP-completeness

In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.

New!!: Non-deterministic Turing machine and NP-completeness · See more »

## P versus NP problem

The P versus NP problem is a major unsolved problem in computer science.

New!!: Non-deterministic Turing machine and P versus NP problem · See more »

## Probabilistic Turing machine

In computability theory, a probabilistic Turing machine is a non-deterministic Turing machine which chooses between the available transitions at each point according to some probability distribution.

New!!: Non-deterministic Turing machine and Probabilistic Turing machine · See more »

## Quantum computing

Quantum computing is computing using quantum-mechanical phenomena, such as superposition and entanglement.

New!!: Non-deterministic Turing machine and Quantum computing · See more »

## Quantum superposition

Quantum superposition is a fundamental principle of quantum mechanics.

New!!: Non-deterministic Turing machine and Quantum superposition · See more »

## Qubit

In quantum computing, a qubit or quantum bit (sometimes qbit) is a unit of quantum information—the quantum analogue of the classical binary bit.

New!!: Non-deterministic Turing machine and Qubit · See more »

## Scott Aaronson

Scott Joel Aaronson (born May 21, 1981) is an American theoretical computer scientist and David J. Bruton Jr.

New!!: Non-deterministic Turing machine and Scott Aaronson · See more »

## Theoretical computer science

Theoretical computer science, or TCS, is a subset of general computer science and mathematics that focuses on more mathematical topics of computing and includes the theory of computation.

New!!: Non-deterministic Turing machine and Theoretical computer science · See more »

## Thought experiment

A thought experiment (Gedankenexperiment, Gedanken-Experiment or Gedankenerfahrung) considers some hypothesis, theory, or principle for the purpose of thinking through its consequences.

New!!: Non-deterministic Turing machine and Thought experiment · See more »

## Turing machine

A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules.

New!!: Non-deterministic Turing machine and Turing machine · See more »

## Redirects here:

NDTM, Non-deterministic turing machine, Nondeterministic Turing machine, Nondeterministic Turing machines, Nondeterministic computation, Nondeterministic turing machine.

## References

[1] https://en.wikipedia.org/wiki/Non-deterministic_Turing_machine