- recursive equation
- лог. рекурсивное равенство
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Recursive definition — A recursive definition or inductive definition is one that defines something in terms of itself (that is, recursively), albeit in a useful way. For it to work, the definition in any given case must be well founded, avoiding an infinite regress.… … Wikipedia
Recursive least squares filter — Recursive least squares (RLS) algorithm is used in adaptive filters to find the filter coefficients that relate to recursively producing the least squares (minimum of the sum of the absolute squared) of the error signal (difference between the… … Wikipedia
Recursive function — may refer to: Recursion (computer science), a procedure or subroutine, implemented in a programming language, whose implementation references itself A total computable function, a function which is defined for all possible inputs See also μ… … Wikipedia
Recursive economics — is a branch of modern economics, which is based on highly complex mathematical function. The models are based on dynamic differential equations. This approach has been popularised by Robert Lucas and Edward Prescott. Books * Recursive Methods in… … Wikipedia
Recursive languages and sets — This article is a temporary experiment to see whether it is feasible and desirable to merge the articles Recursive set, Recursive language, Decidable language, Decidable problem and Undecidable problem. Input on how best to do this is very much… … Wikipedia
Recursive tree — In graph theory, a discipline within mathematics, a recursive tree is a non planar labeled rooted tree. A size n recursive tree is labeled by distinct integers 1, 2, ..., n , where the labels are strictly increasing starting at the root labeled 1 … Wikipedia
Zakai equation — The Zakai equation is a linear recursive filtering equation for the un normalized density of a hidden state. In contrast, the Kushner equation gives a non linear recursive equation for the normalized density of the hidden state. See also *Kalman… … Wikipedia
Bellman equation — A Bellman equation (also known as a dynamic programming equation), named after its discoverer, Richard Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes… … Wikipedia
Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … 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
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