[Solved]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 constants, the successor (add one) function, the function F itself, and expressions built from these by composition of functions. For example, Ackermann’s function is defined by the rules: 1. A (O, y) 1 for any y–O 2, A (l, O)-2 4, A (x + i, y + 1)-A(A (x, y+1), y) for any x>-o and y Answer the following: a) Evaluate A (2, 1) b) What function of x is A(x,2)? c) Evaluate A (4,3 Show transcribed image text 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 constants, the successor (add one) function, the function F itself, and expressions built from these by composition of functions. For example, Ackermann’s function is defined by the rules: 1. A (O, y) 1 for any y–O 2, A (l, O)-2 4, A (x + i, y + 1)-A(A (x, y+1), y) for any x>-o and y Answer the following: a) Evaluate A (2, 1) b) What function of x is A(x,2)? c) Evaluate A (4,3

Expert Answer

---

Answer to 9.2.2 (390) In the box “Why ‘Recursive’?” in Section 9.2.1 we suggested that there was a notion of”recursive function” t… . . .