-
1 binary-valued condition
условие с двумя исходящими
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > binary-valued condition
-
2 binary-valued condition
-
3 binary valued condition
Микроэлектроника: условие с двумя исходамиУниверсальный англо-русский словарь > binary valued condition
-
4 binary-valued condition
Вычислительная техника: условие с двумя исходамиУниверсальный англо-русский словарь > binary-valued condition
-
5 binary-valued condition
English-Russian dictionary of computer science and programming > binary-valued condition
-
6 binary-valued condition
Англо-русский словарь компьютерных и интернет терминов > binary-valued condition
-
7 binary-valued condition
English-Russian information technology > binary-valued condition
-
8 condition
1) условие2) состояние3) ситуация4) pl режим•the condition can be cured by... — ситуация может быть исправлена посредством...
- ageing conditions- aging conditions
- alarm condition
- alert condition
- binary-valued condition
- boundary condition
- busy condition
- class condition
- clock conditions
- compound condition
- context condition
- continuity condition
- continuous-low condition
- cyclically magnetized condition
- deadlock condition
- debugging conditions
- degeneracy condition
- device status condition
- disabled condition
- don't care condition
- dynamic conditions
- entry conditions
- error condition
- exception condition
- exigent condition
- existence condition
- feasibility condition
- full-load conditions
- impending condition
- initial conditions
- limiting condition
- load conditions
- logical condition
- marginal conditions
- matched condition
- match condition
- maximum permissible operation conditions
- mild condition
- mismatch condition
- modifier condition
- normal conditions
- OFF condition
- ON condition
- one condition
- operation condition
- overflow test condition
- overload conditions
- pending condition
- prefault condition
- prefix condition
- pulse conditions
- ready condition
- reflexive condition
- restart condition
- service conditions
- stability condition
- stable condition
- starting condition
- static conditions
- steady-state conditions
- sufficient condition
- symmetrical cyclically magnetized condition
- tail conditions
- tape-out condition
- tenancy condition
- test conditions
- training conditions
- truncation condition
- typical operation conditions
- underflow test condition
- utmost permissible operation conditions
- verification condition
- wait condition
- working condition
- worst-case conditions
- zero condition
- zero-initial conditionEnglish-Russian dictionary of computer science and programming > condition
См. также в других словарях:
условие с двумя исходящими — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN binary valued condition … Справочник технического переводчика
Comparison of Pascal and C — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations … Wikipedia
T-norm fuzzy logics — are a family of non classical logics, informally delimited by having a semantics which takes the real unit interval [0, 1] for the system of truth values and functions called t norms for permissible interpretations of conjunction. They are mainly … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… … Wikipedia
List of mathematics articles (B) — NOTOC B B spline B* algebra B* search algorithm B,C,K,W system BA model Ba space Babuška Lax Milgram theorem Baby Monster group Baby step giant step Babylonian mathematics Babylonian numerals Bach tensor Bach s algorithm Bachmann–Howard ordinal… … Wikipedia
Chu space — Chu spaces generalize the notion of topological space by dropping the requirements that the set of open sets be closed under union and finite intersection, that the open sets be extensional, and that the membership predicate (of points in open… … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Exponentiation — Exponent redirects here. For other uses, see Exponent (disambiguation). Exponentiation is a mathematical operation, written as an, involving two numbers, the base a and the exponent (or power) n. When n is a positive integer, exponentiation… … Wikipedia
