# 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](https://mapideas.org/i/math)
- [Gödel](https://mapideas.org/i/godel)
- [programs](https://mapideas.org/i/s_prog)
- [Algorithms](https://mapideas.org/i/mat_algorithm)
- [When is a proof enough?](https://mapideas.org/i/q_math_enough)
- [Can a machine find new math?](https://mapideas.org/i/q_math_machine)
- [DNA and heredity](https://mapideas.org/i/li_dna)
- [Computers](https://mapideas.org/i/te_computers)
- [What is a living thing?](https://mapideas.org/i/q_x_living)

Sources:
- [Wikipedia: Halting problem](https://en.wikipedia.org/wiki/Halting_problem)
- [Wikipedia: Turing machine](https://en.wikipedia.org/wiki/Turing_machine)

Source: https://mapideas.org/i/mat_computation · open on the map: https://mapideas.org/#mat_computation