- simultaneous recursion
- мат. одновременная рекурсия
Большой англо-русский и русско-английский словарь. 2001.
simultaneous recursion
Смотреть что такое "simultaneous recursion" в других словарях:
History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
Compiler optimization — is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the… … Wikipedia
Criticism of Noam Chomsky — Noam Chomsky (born December 7, 1928) is an American linguist, philosopher, political activist, author and lecturer. Chomsky is widely known for his critique of U.S. foreign policy, beginning with his critique of the Vietnam War in the 1960s. Much … Wikipedia
Indian mathematics — mdash;which here is the mathematics that emerged in South Asia from ancient times until the end of the 18th century mdash;had its beginnings in the Bronze Age Indus Valley civilization (2600 1900 BCE) and the Iron Age Vedic culture (1500 500 BCE) … Wikipedia
Exponentiation by squaring — Exponentiating by squaring is an algorithm used for the fast computation of large integer powers of a number. It is also known as the square and multiply algorithm or binary exponentiation. In additive groups the appropriate name is double and… … Wikipedia
Recurrence relation — Difference equation redirects here. It is not to be confused with differential equation. In mathematics, a recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the… … Wikipedia
Fast Kalman filter — The fast Kalman filter (FKF), devised by Antti Lange (1941 ), is an extension of the Helmert Wolf blockingfn|1 (HWB) method from geodesy to real time applications of Kalman filtering (KF) such as satellite imaging of the Earth. Kalman filters are … Wikipedia
Infinity-Borel set — In set theory, a subset of a Polish space X is infin; Borel if itcan be obtained by starting with the open subsets of X, and transfinitely iterating the operations of complementation and wellordered union (but see the caveat below). Formal… … Wikipedia
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia
Necessary and sufficient condition — This article is about the formal terminology in logic. For causal meanings of the terms, see Causality. In logic, the words necessity and sufficiency refer to the implicational relationships between statements. The assertion that one statement is … Wikipedia
