To Mock a Mockingbird: And Other Logic Puzzles (Paperback)
$14.55 - Save $2.57 15% off - RRP $17.12 Free shipping worldwide (to United States and
all these other countries) Usually dispatched within 24 hours
Short Description for To Mock a Mockingbird This is a puzzle book covering logic, philosophy, psychology, artificial intelligence, computer science and mathematics. It contains many puzzles and their solutions and aims to attract many readers in an age where computer science, logic, and mathematics are becoming increasingly important.
- Published: 09 November 2000
- Format: Paperback 256 pages
- ISBN 13: 9780192801425 ISBN 10: 0192801422
- Sales rank: 47,974
$8.75 - Save $2.20 20% off - RRP $10.95
$12.52 - Save $0.43 (3%) - RRP $12.95
$13.87 - Save $1.08 (7%) - RRP $14.95
$10.49 - Save $0.46 (4%) - RRP $10.95
Full description for To Mock a Mockingbird
In this entertaining and challenging collection of logic puzzles, Raymond Smullyan - author of Forever Undecided - continues to delight and astonish us with his gift for making available, in the thoroughly pleasurable form of puzzles, some of the most important mathematical thinking of our time. In the first part of the book, he transports us once again to that wonderful realm where knights, knaves, twin sisters, quadruplet brothers, gods, demons, and mortals either always tell the truth or always lie, and where truth-seekers are set a variety of fascinating problems. The section culminates in an enchanting and profound metapuzzle in which Inspector Craig of Scotland Yard gets involved in a search for the Fountain of Youth on the Island of Knights and Knaves. In the second part of To Mock a Mockingbird, we accompany the Inspector on a summer-long adventure into the field of combinatory logic (a branch of logic that plays an important role in computer science and artificial intelligence). His adventure, which includes enchanted forests, talking birds, bird sociologists, and a classic quest, provides for us along the way the pleasure of solving puzzles of increasing complexity until we reach the Master Forest and - thanks to Godel's famous theorem - the final revelation.