1. Show that for each u, there are infinitely many different numbers v such that for all x, u(x) = v(x)

Exercise 1, Page 77 of the book: Computability,Complexity, and Languages by Davis, Sigal, Weyuker

i. Show that for each u, there are infinitely many different numbers v such that for all x, A(x) (x). i. Show that for each u, there are infinitely many different numbers v such that for all x, A(x) (x)