Abstract

This book presents one of the most intellectually challenging aspects of computer related mathematics/logic in a way which should make it accessible to a wider audience. The authors look at different types of reduction to show undecidability, but do so using the novel approach of conversation between three famous mathematicians - sometimes using their own words and sometimes in an adapted form. The authors are of international repute and they provide a modern and authoritative treatment of undecidability with special emphasis on rigorous proofs. Numerous worked examples are included.