9. For every number n, let A, = {x | n Wx}.

(a) Show that Ai is r.e. but not recursive, for all i.

(b) Show that Ai m Aj for all i, j.

Exercise 9, Page 94 of the book: Computability,Complexity, and Languages by Davis, Sigal, Weyuker

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