Il libro è attualmente esaurito
Maggiori informazioni sul libro
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.
Acquisto del libro
Enumerability · Decidability Computability, Hans Hermes
- Lingua
- Pubblicato
- 2012
- product-detail.submit-box.info.binding
- (In brossura)
Ti avviseremo via email non appena lo rintracceremo.
Metodi di pagamento
Ancora nessuna valutazione.