💡 Words with a Similar Meaning to "Probabilistic turing machine"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| nondeterministic turing machinenoun | (computer science) A variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read. |
| quantum turing machine | A quantum Turing machine or universal quantum computer is an abstract machine used to model the effects of a quantum computer. |
| 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. |
| random binary tree | In computer science and probability theory, a random binary tree is a binary tree selected at random from some probability distribution on binary trees. |
| 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. |
| probabilistic classification | In machine learning, a probabilistic classifier is a classifier that is able to predict, given an observation of an input, a probability distribution over a set of classes, rather than only outputting the most likely class that the observation should belong to. |
| 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). |
| probability distributionnoun | (statistics) A distribution of all possible values of a random variable together with an indication of their probabilities. |
| 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. |
| branching processnoun | (mathematics, probability theory) A stochastic process which typically models reproduction of objects, with the assumption that the reproductions of individual particles are mutually independent. |
| markov chainnoun | (probability theory) A discrete-time stochastic process containing a Markov property. |
| 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ᴼ⁽¹⁾). |
| restricted boltzmann machine | A restricted Boltzmann machine (also called a restricted Sherrington–Kirkpatrick model with external field or restricted stochastic Ising–Lenz–Little model) is a generative stochastic artificial neural network that can learn a probability distribution over its set of inputs. |
| probabilistic programming | a programming paradigm in which probabilistic models are specified and inference for these models is performed automatically. |
| algorithmic probability | In algorithmic information theory, algorithmic probability, also known as Solomonoff probability, is a mathematical method of assigning a prior probability to a given observation. |
| turing jumpnoun | (computing theory) In computability theory, an operation that assigns to each decision problem X a successively harder decision problem X′ with the property that X′ is not decidable by an oracle machine with an oracle for X. |
| quantum statenoun | (quantum mechanics) Any of the possible states of a quantum mechanical system. |
| nspace | In computational complexity theory, non-deterministic space or NSPACE is the computational resource describing the memory space for a non-deterministic Turing machine. |
| state-transition table | In automata theory and sequential logic, a state-transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite-state machine will move to, based on the current state and other inputs. |
| stochastic simulation | A stochastic simulation is a simulation of a system that has variables that can change stochastically (randomly) with individual probabilities. |
Translate “Probabilistic turing machine” into Another Language
Pick a language — the word will be pre-filled in the translator.