| 单词 | Recursion |
| 释义 | RecursionA recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of Recurrence Relation, the entire class of objects can then be built up from a few initial values and asmall number of rules. The Fibonacci Numbers are most commonly defined recursively.Care, however, must be taken to avoid Self-Recursion, in which an object is defined in terms of itself,leading to an infinite nesting. See also Ackermann Function, Primitive Recursive Function, Recurrence Relation, RecurrenceSequence, Richardson's Theorem, Self-Recursion, Self-Similarity, TAK Function
Buck, R. C. ``Mathematical Induction and Recursive Definitions.'' Amer. Math. Monthly 70, 128-135, 1963. Knuth, D. E. ``Textbook Examples of Recursion.'' In Artificial Intelligence and Mathematical Theory of Computation, Papers in Honor of John McCarthy (Ed. V. Lifschitz). Boston, MA: Academic Press, pp. 207-229, 1991. Péter, R. Rekursive Funktionen. Budapest: Akad. Kiado, 1951. |
| 随便看 |
|
数学辞典收录了8975条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。