Cornerstones of undecidability
Author(s)
Bibliographic Information
Cornerstones of undecidability
（Prentice-Hall International series in computer science）
Prentice Hall, 1994
Available at / 5 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 193-194) and index
Description and Table of Contents
Description
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.
Table of Contents
- Halting problem
- post correspondence problem
- diophantine problems
- classes of problems and proofs
- the secret number.
by "Nielsen BookData"
