Content deleted Content added
m +pl: |
m stanford encyclopedia link |
||
Line 18:
It is interesting to note that if the application of the unbounded search operator in the definition above is limited strictly to ''regular functions'' (functions which are guaranteed to be total when the unbounded search operator is applied to them), the resulting set (historically called the ''general recursive functions'') is the same as the set of recursive functions -- in other words, the requirement for partial functions can be partially obviated.
== External link ==
*[http://plato.stanford.edu/entries/recursive-functions/ Stanford Encyclopedia of Philosophy entry]
[[Category:Computability]]
| |||