| 单词 | partial recursive |
| 释义 | > as lemmaspartial recursive partial recursive adj. Mathematics and Logic designating a function defined by a recursive process which for some or all values of the arguments does not terminate, so that the value of the function is undefined.The failure of the recursive process to terminate might be due to a value of the argument for which the function is specified not appearing in the sequence of steps, working back from the one in which the argument appears. ΘΚΠ the world > relative properties > number > algebra > [adjective] > relating to expressions > relating to functions > recursive general recursive1936 primitive recursive1936 partial recursive1938 1938 S. C. Kleene in Jrnl. Symbolic Logic 3 151 If we omit the requirement that the computation process always terminate, we obtain a more general class of functions, each function of which is defined over a subset (possibly null or total) of the n-tuples of natural numbers... These functions we call partial recursive. 2004 Proc. Royal Soc. A. 460 1536 The study of Diophantine equations essentially covers the class of partial recursive functions, which is at the foundation of computability. < as lemmas |
| 随便看 |
英语词典包含1132095条英英释义在线翻译词条，基本涵盖了全部常用单词的英英翻译及用法，是英语学习的有利工具。