Content deleted Content added
No edit summary |
why "total" specifically? Partial recursive == partial computable, total recursive == total computable. I'm not aware of any convention requiring recursive functions to be total and computable ones not. |
||
Line 1:
'''Recursive function''' may refer to:
*[[Recursion (computer science)]], a procedure or subroutine, implemented in a programming language, whose implementation references itself
*A
* [[Primitive recursive function]]
| |||