idea
Computation
In 1936 Turing described a machine that follows simple rules and asked what such machines can decide. The halting problem, whether a program will ever stop, has no general answer. It is the same kind of limit Gödel found, seen from the side of programs.
Connects to
- Math
- Gödel
- programs
- Algorithms
- When is a proof enough?
- Can a machine find new math?
- DNA and heredity
- Computers
- What is a living thing?