-
61 примитивный
1. primitive2. primitivelyРусско-английский словарь по информационным технологиям > примитивный
-
62 примитивный
1. ignorant2. primitiveСинонимический ряд:просто (проч.) просто; элементарно -
63 примитивный
1. primitive2. primitively -
64 собственно примитивный
Русско-английский военно-политический словарь > собственно примитивный
-
65 собственно примитивный
-
66 равномерная примитивная рекурсия
Большой англо-русский и русско-английский словарь > равномерная примитивная рекурсия
-
67 примитивная рекурсия
Mathematics: primitive recursionУниверсальный русско-английский словарь > примитивная рекурсия
-
68 равномерная примитивная рекурсия
Information technology: uniform primitive recursionУниверсальный русско-английский словарь > равномерная примитивная рекурсия
-
69 равномерно примитивная рекурсия
Mathematics: uniform primitive recursionУниверсальный русско-английский словарь > равномерно примитивная рекурсия
-
70 равномерная примитивная рекурсия
Русско-английский словарь по вычислительной технике и программированию > равномерная примитивная рекурсия
-
71 равномерно примитивная рекурсия
Русско-английский научно-технический словарь Масловского > равномерно примитивная рекурсия
-
72 recurrencia primitiva
f.primitive recursion. -
73 formula
1) рецепт2) формула || формульный3) формулировка•- arithmetically valid formula - back interpolation formula - computational formula - computing formula - corrector formula - formally decidable formula - formally refutable formula - formula of finite increments - geometrically valid formula - homomorphically stable formula - identically false formula - identically true formula - intuitionistically valid formula - logically valid formula - maximum likelihood formula - modally valid formula - monotonically increasing formula - numeralwise expressible formula - numeralwise representable formula - positively valid formula - primitively recursive formula - reciprocity formula - secondarily valid formula - square stable formula - universally valid formulato follow the formula — подчиняться [следовать] формуле; описываться формулой
-
74 relation
1) зависимость, (взаимо)связь2) отношение; соотношение4) геол. условия залегания•- almost universal relation - cause-effect relation - generalized semigroup relation - logically irreducible relation - parametrically definable relation - partial ordering relation - recursively enumerable relation - recursively invariant relation - recursively representable relation - strongly definable relation - weakly symmetric relation -
75 scheme
1) схема || составлять схему2) план; замысел || планировать, замышлять•- composite sampling scheme - decisive scheme - double sampling scheme - singly connected scheme
См. также в других словарях:
primitive recursion — noun a) Recursion to a fixed depth. b) The operator that creates a new function from two functions and such that: <br /> … Wiktionary
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Primitive recursive arithmetic — Primitive recursive arithmetic, or PRA, is a quantifier free formalization of the natural numbers. It was first proposed by Skolem [Thoralf Skolem (1923) The foundations of elementary arithmetic in Jean van Heijenoort, translator and ed. (1967)… … Wikipedia
Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… … Wikipedia
Recursion — Recursion, in mathematics and computer science, is a method of defining functions in which the function being defined is applied within its own definition. The term is also used more generally to describe a process of repeating objects in a self… … Wikipedia
Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… … Wikipedia
Récursion Primitive — Fonction récursive primitive Une fonction récursive primitive est une fonction définie principalement à l aide de fonctions primitives de récursion et de composition. Ces fonctions constituent un sous ensemble des fonctions récursives. Elles ont… … Wikipédia en Français
Récursion — Récursif Cette page d’homonymie répertorie les différents sujets et articles partageant un même nom … Wikipédia en Français
primitive recursive — adjective Of a function, capable of being constructed from the zero function, successor function, and projection functions, by a finite number of applications of composition and recursion … Wiktionary
Course-of-values recursion — In computability theory, course of values recursion is a technique for defining number theoretic functions by recursion. In a definition of a function f by course of values recursion, the value of f(n+1) is computed from the sequence . The fact… … Wikipedia
Double recursion — In recursive function theory, double recursion is an extension of primitive recursion which allows the definition of non primitive recursive functions like the Ackermann function. Raphael M. Robinson called functions of two natural number… … Wikipedia