nonrecursive
Look at other dictionaries:
Digital filter — A general finite impulse response filter with n stages, each with an independent delay, di, and amplification gain, ai. In electronics, computer science and mathematics, a digital filter is a system that performs mathematical operations on a… … Wikipedia
Filter design — is the process of designing a filter (in the sense in which the term is used in signal processing, statistics, and applied mathematics), often a linear shift invariant filter, which satisfies a set of requirements, some of which are contradictory … Wikipedia
Window function — For the term used in SQL statements, see Window function (SQL) In signal processing, a window function (also known as an apodization function or tapering function[1]) is a mathematical function that is zero valued outside of some chosen interval … Wikipedia
Real computation — In computability theory, the theory of real computation deals with hypothetical computing machines using infinite precision real numbers. They are given this name because they operate on the set of real numbers. Within this theory, it is possible … Wikipedia
Actor model — In computer science, the Actor model is a mathematical model of concurrent computation that treats actors as the universal primitives of concurrent digital computation: in response to a message that it receives, an actor can make local decisions … Wikipedia
History of the Actor model — In computer science, the Actor model, first published in 1973 ref harvard|Hewitt|Hewitt et al. 1973| , is a mathematical model of concurrent computation. Many fundamental issues were discussed and debated in the early history of the Actor model.… … Wikipedia
Unbounded nondeterminism — In computer science, unbounded nondeterminism or unbounded indeterminacy is a property of concurrency by which the amount of delay in servicing a request can become unbounded as a result of arbitration of contention for shared resources while… … Wikipedia
RE (complexity) — In computability theory and computational complexity theory, RE (recursively enumerable) is the class of decision problems for which a yes answer can be verified by a Turing machine in a finite amount of time.[1] Informally, it means that if the… … Wikipedia
Actor model and process calculi history — The Actor model and process calculi share an interesting history and co evolution.Early workThe Actor model, first published in 1973, [Carl Hewitt, Peter Bishop and Richard Steiger. A Universal Modular Actor Formalism for Artificial Intelligence… … Wikipedia
Algorithmically random sequence — Intuitively, an algorithmically random sequence (or random sequence) is an infinite sequence of binary digits that appears random to any algorithm. The definition applies equally well to sequences on any finite set of characters. Random sequences … Wikipedia
