💡 Words with a Similar Meaning to "Nondeterministic programming"
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. |
| 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. |
| 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. |
| differentiable programming | a programming paradigm in which a numeric computer program can be differentiated throughout via automatic differentiation. |
| pattern languagenoun | (architecture, design, software) A structured method of describing good design practices within a field of expertise. |
| flow-sensitive typing | — |
| nonlinear programming | In mathematics, nonlinear programming is the process of solving an optimization problem where some of the constraints are not linear equalities or the objective function is not a linear function. |
| probabilistic programming | a programming paradigm in which probabilistic models are specified and inference for these models is performed automatically. |
| data-flow analysis | a technique for gathering information about the possible set of values calculated at various points in a computer program. |
| randomized algorithmnoun | (mathematics) Any algorithm that uses randomness as part of its logic. |
| determinantal point process | In mathematics, a determinantal point process is a stochastic point process, the probability distribution of which is characterized as a determinant of some function. |
| stochastic simulation | A stochastic simulation is a simulation of a system that has variables that can change stochastically (randomly) with individual probabilities. |
| context-sensitive language | In formal language theory, a context-sensitive language is a language that can be defined by a context-sensitive grammar (and equivalently by a noncontracting grammar). |
| 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. |
| decision problemnoun | (computing theory) A question in some formal system with a yes-or-no answer, depending on the values of input parameters. |
| 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. |
| boolean expressionnoun | — |
| non-configurational language | In generative grammar, non-configurational languages are languages characterized by a flat phrase structure, which allows syntactically discontinuous expressions, and a relatively free word order. |
| phase spacenoun | (mathematics, physics, dynamical system theory) Given a (dynamical) system, any topological space such that every point in the space's underlying set uniquely represents a state of the system and every possible state is represented by some point; |
| halting problemnoun | (computer science) The problem of deciding in finite time whether a given program will finish running in finite time, when given a certain finite input. |
Translate “Nondeterministic programming” into Another Language
Pick a language — the word will be pre-filled in the translator.