ABSTRACT
The proof of Corollary 5.3.7 is a simple example of how one proves problems to be unsolvable in practice. Almost always one reduces some known unsolvable problem to the one one is interested in, to get the required unsolvability. It is a very powerful method, and is used not just in classical computability theory but in situations arising in computer science with more restrictive notions of computability.
