Content deleted Content added
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. |
Narky Blert (talk | contribs) +1 SA |
||
Line 7:
*[[μ-recursive function]], defined from a particular formal model of computable functions using primitive recursion and the μ operator
*[[Recurrence relation]], in mathematics, an equation that defines a sequence recursively
*Recursion theory or [[computability theory]], a branch of mathematical logic, of computer science, and of the theory of computation
{{disambig}}
| |||