| 单词 | primitive recursion |
| 释义 | > as lemmasprimitive recursion primitive recursion n. [after German primitive Rekursion (R. Péter 1934, in Math. Ann. 110 613)] Mathematics the process of defining a function of the natural numbers by induction, given the value of the function for a particular value of the argument, or (equivalently) by simple recursion formulae. ΚΠ 1943 Trans. Amer. Math. Soc. 53 42 Schema (I) introduces the successor function,..and Schema (V) the schema of primitive recursion. 1962 H. Wang Surv. Math. Logic xiii. 343 If g, h can be represented in Z, then a function f defined by primitive recursion..can be represented in Z in the sense that there is a formula R(x, y, z) in Z such that the following are theorems of Z. 2000 S. Shapiro Philos. Math. v. 172 He defined addition and multiplication on ‘the natural numbers’ and proved that definitions by primitive recursion do define functions. < as lemmas |
| 随便看 |
英语词典包含1132095条英英释义在线翻译词条，基本涵盖了全部常用单词的英英翻译及用法，是英语学习的有利工具。