Book contents
- Computational Thinking for Life Scientists
- Reviews
- Computational Thinking for Life Scientists
- Copyright page
- Dedication
- Contents
- Introduction
- Part I: Programming in Python
- Part II: Sequences
- Part III: Graphs and Networks
- Part IV: Images
- Part V: Limitations of Computing
- 10 Mission Impossible
- 11 Mission Infeasible
- Index
10 - Mission Impossible
from Part V: - Limitations of Computing
Published online by Cambridge University Press: 19 August 2022
Book contents
- Computational Thinking for Life Scientists
- Reviews
- Computational Thinking for Life Scientists
- Copyright page
- Dedication
- Contents
- Introduction
- Part I: Programming in Python
- Part II: Sequences
- Part III: Graphs and Networks
- Part IV: Images
- Part V: Limitations of Computing
- 10 Mission Impossible
- 11 Mission Infeasible
- Index
Summary
In this chapter, we will define Turing’s Halting Problem. We will then describe Turing’s proof that the Halting Problem cannot be solved by any computer, ever. This was the first problem proven to be, fundamentally, beyond the capabilities of any computer. This result subsequently served as a springboard to prove that a whole, infinite class of other problems are unsolvable as well.
- Type
- Chapter
- Information
- Computational Thinking for Life Scientists , pp. 189 - 196Publisher: Cambridge University PressPrint publication year: 2022