922 390 Box Recursive Section 921 Suggested Notion Recursive Function Competed Turing Mach Q37218761

9.2.2 (390) In the box “Why ‘Recursive’?” in Section 9.2.1 we suggested that there was a notion of”recursive function” that competed with the Turing machine as a model for what can be computed. In this exercise, we shall explore an example of the recursive-function notation. A recursive function is a function F defined by a finite set of rules. Each rule specifies the value of the function F for certain arguments; the specification can use variables, nonnegative-integer

OR

 

OR