| 单词 | Primitive Recursive Function |
| 释义 | Primitive Recursive FunctionFor-loops (which have a fixed iteration limit) are a special case of while-loops. A function which can be implementedusing only for-loops is called primitive recursive. (In contrast, a Computable Function can be coded using acombination of for- and while-loops, or while-loops only.) The Ackermann Function is the simplest example of a well-defined Total Function which isComputable but not primitive recursive, providing a counterexample to the belief in the early1900s that every Computable Function was also primitive recursive (Dötzel 1991). See also Ackermann Function, Computable Function, Total Function
Dötzel, G. ``A Function to End All Functions.'' Algorithm: Recreational Programming 2, 16-17, 1991. |
| 随便看 |
|
数学辞典收录了8975条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。