Enumerability · Decidability Computability
An Introduction to the Theory of Recursive Functions
- 264 pages
- 10 hours of reading
The book explores the limitations of algorithms in mathematics, addressing whether certain problems are inherently unsolvable by algorithmic methods. It highlights significant findings from the past century, such as the undecidability of arithmetic and the unsolvability of the word problem in group theory, which many mathematicians regard as pivotal achievements. The discussion extends to the philosophical implications of these limitations, questioning the nature of mathematical creativity and the role of mathematics in shaping our understanding of the world. An introduction to algorithm theory is also provided.
