| To Halt or Not to Halt? That Is the Question Contributor(s): Calude, Cristian S. (Author) |
|
 |
ISBN: 981123227X ISBN-13: 9789811232275 Publisher: World Scientific Publishing Company OUR PRICE: $121.60 Product Type: Hardcover Published: May 2024 |
| Additional Information |
| BISAC Categories: - Computers | Natural Language Processing - Philosophy | Logic |
| Physical Information: 0.75" H x 6" W x 9" (1.35 lbs) 332 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: This is a book about the 'Halting Problem', arguably the most (in)famous computer-related problem: can an algorithm decide in finite time whether an arbitrary computer program eventually stops? This seems a dull, petty question: after all, you run the program and wait till it stops. However, what if the program does not stop in a reasonable time, a week, a year, a decade? Can you infer that it will never stop? The answer is negative. Does this raise your interest? If not, consider these questions: Can mathematics be done by computers only? Can software testing be fully automatised? Can you write an anti-virus program which never needs any update? Can we make the internet perfectly secure? Your guess is correct: the answer to each question is negative. In fact, the Halting Problem is 'hidden' in many subjects, from logic (is mathematics free of contradictions?), physics (is quantum randomness perfect?), biology (can we re-program cells to immortality?), to philosophy (do humans have free will, or do our brains generate our thoughts and decisions in a deterministic way?) and theology (can God solve the Halting Problem?) -- this book will visit each of them.Written in an informal and thought-provoking language, supported with suggestive illustrations and applications and almost free of arcane mathematics (formal arguments are relegated to a special part dedicated to the mathematically-oriented reader), the book will stimulate the curiosity of the reader interested in the consequences of the limits of computing and in various attempts to cope with them. |