💡 Words with a Similar Meaning to "Nondeterministic turing machine"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| probabilistic turing machine | In theoretical computer science, a probabilistic Turing machine is a non-deterministic Turing machine that chooses between the available transitions at each point according to some probability distribution. |
| quantum turing machine | A quantum Turing machine or universal quantum computer is an abstract machine used to model the effects of a quantum computer. |
| model of computation | In computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how an output of a mathematical function is computed given an input. |
| nondeterministic programming | A nondeterministic programming language is a language which can specify, at certain points in the program (called "choice points"), various alternatives for program flow. |
| theory of computation | In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree (e.g., approximate solutions versus precise ones). |
| nondeterministic algorithm | In computer science and computer programming, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. |
| nspace | In computational complexity theory, non-deterministic space or NSPACE is the computational resource describing the memory space for a non-deterministic Turing machine. |
| hypercomputationnoun | (computing) Any of several forms of computation that are theoretically (or practically) impossible with current technology. |
| nexptimenoun | (computer science) In computational complexity theory, a complexity class in which the set of decision problems can be solved by a nondeterministic Turing machine using time 2^(nᴼ⁽¹⁾). |
| real computation | In computability theory, the theory of real computation deals with hypothetical computing machines using infinite-precision real numbers. |
| circuitnoun | (electricity) Enclosed path of an electric current, usually designed for a certain function. |
| quantum finite automaton | In quantum computing, quantum finite automata or quantum state machines are a quantum analog of probabilistic automata or a Markov decision process. |
| deterministic system | A deterministic system is a conceptual model of the philosophical doctrine of determinism applied to a system for understanding everything that has and will occur in the system, based on the physical outcomes of causality. |
| function problem | In computational complexity theory, a function problem is a computational problem where a single output (of a total function) is expected for every input, but the output is more complex than that of a decision problem. |
| computer simulationnoun | (software engineering) A computer model. |
| quantum circuit | In quantum information theory, a quantum circuit is a model for quantum computation, similar to classical circuits, in which a computation is a sequence of quantum gates, measurements, initializations of qubits to known values, and possibly other actions. |
| finite-state machinenoun | (computing theory) A formalism for describing computation, consisting of a finite set of states and a transition function describing when to move from one state to another. |
| semiautomatonnoun | (mathematics, computer science) a multiplicative operation of a monoid on a set |
| simulationnoun | Something that simulates a system or environment in order to predict actual behaviour. |
| moore machinenoun | (computing theory) A finite-state machine whose output values are determined solely by its current state. |
Translate “Nondeterministic turing machine” into Another Language
Pick a language — the word will be pre-filled in the translator.