Presents an intellectually challenging aspect of computer related mathematics/logic in a way which should make it more accessible. The authors look at different... » 

Presents an intellectually challenging aspect of computer related mathematics/logic in a way which should make it more accessible. The authors look at different types of reduction to show undecidability, using the novel approach of conversation between three famous mathematicians. «