Turing machines
- computation
- european
"On Computable Numbers" defines computation with an abstract machine and proves the halting problem undecidable.
From the Ishango bone to formalized proofs: arithmetic, geometry, algebra, analysis, probability, logic and topology across Babylonian, Egyptian, Greek, Indian, Chinese, Islamic and European mathematics and beyond. Moments are tagged by area (and colored by it) and by civilization; eras are shown as spans. Ancient dates are approximate and say so. Summaries are our own; each moment links to its Wikipedia articles.
99 moments · 20000-01-01T00:00:00Z BCE – 2020-01-01T00:00:00Z CE · by @athan · @athan
"On Computable Numbers" defines computation with an abstract machine and proves the halting problem undecidable.