- recursion induction
- мат. рекурсивная индукция
Большой англо-русский и русско-английский словарь. 2001.
recursion induction
Смотреть что такое "recursion induction" в других словарях:
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
Transfinite induction — is an extension of mathematical induction to well ordered sets, for instance to sets of ordinals or cardinals. Transfinite induction Let P(α) be a property defined for all ordinals α. Suppose that whenever P(β) is true for all β < α, then P(α) is … Wikipedia
Structural induction — is a proof method that is used in mathematical logic (e.g., the proof of Łoś theorem), computer science, graph theory, and some other mathematical fields. It is a generalization of mathematical induction. Structural recursion is a recursion… … Wikipedia
Mathematical induction — can be informally illustrated by reference to the sequential effect of falling dominoes. Mathematical induction is a method of mathematical proof typically used to establish that a given statement is true of all natural numbers (positive… … 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
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
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
Counter machine — A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation. It is the most primitive of the four types of register machines. A counter machine comprises a set of one or more unbounded… … Wikipedia
San Diego Math Circle — Founded by Richard Rusczyk in 2003, the San Diego Math Circle serves fifth to twelfth grade students in the San Diego area. Offering free classes for avid middle and high school math students at UCSD, it quickly grew to become one of the largest… … Wikipedia
University of Chicago School Mathematics Project — The University of Chicago School Mathematics Project (UCSMP) was founded in 1983 at the University of Chicago with the aim of upgrading mathematics education in elementary and secondary schools throughout the United States. The UCSMP has created… … Wikipedia
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
