Exercise 9 page 94, Second Edition : Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science Martin D. Davis,Ron Sigal,Elaine J. Weyuker

9. For every number n, let A, {xln EW). (a) Show that Ai is r e. but not recursive, for all i (b) Show that A m Ai for all i, j 9. For every number n, let A, {xln EW). (a) Show that Ai is r e. but not recursive, for all i (b) Show that A m Ai for all i, j