recursive sequence

См. также в других словарях:

• 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 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

• Recursive language — This article is about a class of formal languages as they are studied in mathematics and theoretical computer science. For computer languages that allow a function to call itself recursively, see Recursion (computer science). In mathematics,… …   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 indexing — When number (generally large number) is represented in a finite alphabet set, and itcannot be represented by just one member of the set, Recursive Indexing is used.Recursive Indexing itself is a method to write the successive differences of the… …   Wikipedia

• Séquence de Fibonacci — Suite de Fibonacci La suite de Fibonacci est une suite d entiers très connue. Elle doit son nom à un mathématicien italien connu sous le nom de Leonardo Fibonacci qui, dans un problème récréatif posé dans un de ses ouvrages, le Liber Abaci,… …   Wikipédia en Français

• Hofstadter sequence — In mathematics, a Hofstadter sequence is a member of a family of related integer sequences defined by non linear recurrence relations. equences presented in Gödel, Escher, Bach: an Eternal Golden Braid The first Hofstadter sequences were… …   Wikipedia

• Aliquot sequence — In mathematics, an aliquot sequence is a recursive sequence in which each term is the sum of the proper divisors of the previous term. The aliquot sequence starting with a positive integer k can be defined formally in terms of the sum of divisors …   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

• Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… …   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