Content deleted Content added
→Proposed move: make this part stand out |
Programinfo (talk | contribs) mNo edit summary |
||
Line 109:
* Who introduced the concept, and for which purpose (AFIK, this is [[Gödel]] for the purpose of [[decidable problem|decidability theory]], which is now a part of [[computability theory]]).
* Equivalence with [[lambda calculus]] and [[Turing machine]]s (AFIK, this is due to [[Kleene]]), relationship with [[Church–Turing thesis]].
* History of the terminology (AFIK, "μ-recursive function" is relatively recent, and Kleene used "general [https://www.chlopadhe.com/recursion-in-c/ recursive function]"). I ignore whether Gödel used "general recursive function" or simply "recursive function"). See also next thread.
Such an historical section seems the best way for explaining the choice of not imposing "total" for the minimization operator.
| |||