|
|
![[parent]](http://images.planetmath.org:8080/images/uparrow.png) Viewing Message
|
|
|
| ``aka ``recursive''''
by ariels on 2002-06-05 07:32:33 |
|
| ``Turing computable'' functions are also called ``recursive'' functions. (The confusion stems from the pre-Church-Turing days, when the concept of recursive function was defined by adding minimization to primitive recursive functions, and it was not clear that Turing machines had exactly the same power).
Could this synonym be added?
|
| | [ reply | up ] | |
|
|
|
|
|
|
|
