- deterministic case
- мат. детерминированный случай
Большой англо-русский и русско-английский словарь. 2001.
deterministic case
Смотреть что такое "deterministic case" в других словарях:
Deterministic encryption — A deterministic encryption scheme (as opposed to a probabilistic encryption scheme) is a cryptosystem which always produces the same ciphertext for a given plaintext and key, even over separate executions of the encryption algorithm. Examples of… … Wikipedia
Deterministic algorithm — In computer science, a deterministic algorithm is an algorithm which, in informal terms, behaves predictably. Given a particular input, it will always produce the same output, and the underlying machine will always pass through the same sequence… … Wikipedia
Finite & Deterministic Discrete Event System Specification — FD DEVS (Finite Deterministic Discrete Event System Specification) is a formalism for modeling and analyzing discrete event dynamic systems in both simulation and verification ways. FD DEVS also provides modular and hierarchical modeling features … Wikipedia
Two-way deterministic finite automaton — In computer science, a two way deterministic finite automaton (2DFA) is an abstract machine, a generalized version of the deterministic finite automaton (DFA) which can revisit characters already processed. As in a DFA, there are a finite number… … Wikipedia
Average-case complexity — For deterministic algorithms, the average case complexity (expected time complexity), associates a given input distribution with the expected time of an algorithm.Leonid Levin presented the motivation for studying average case complexity as… … Wikipedia
Local hidden variable theory — In quantum mechanics, a local hidden variable theory is one in which distant events are assumed to have no instantaneous (or at least faster than light) effect on local ones. According to the quantum entanglement theory of quantum mechanics, on… … Wikipedia
Random dynamical system — In mathematics, a random dynamical system is a measure theoretic formulation of a dynamical system with an element of randomness , such as the dynamics of solutions to a stochastic differential equation. It consists of a base flow, the noise ,… … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Chaos theory — This article is about chaos theory in Mathematics. For other uses of Chaos theory, see Chaos Theory (disambiguation). For other uses of Chaos, see Chaos (disambiguation). A plot of the Lorenz attractor for values r = 28, σ = 10, b = 8/3 … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Determinism — This article is about the general notion of determinism in philosophy. For other uses, see Determinism (disambiguation). Not to be confused with Fatalism, Predeterminism, or Predictability. Certainty series … Wikipedia
