Breaking the speed limit.
Saved in:
| Title: | Breaking the speed limit. (cover story) |
|---|---|
| Authors: | Elwes, Richard (AUTHOR) |
| Source: | New Scientist. 4/25/2026, Vol. 270 Issue 3592, p38-41. 4p. 2 Color Photographs, 1 Cartoon or Caricature. |
| Subjects: | Incompleteness theorems, Mathematical sequences, Mathematical logic, Graph theory, Mathematics theorems |
| Abstract: | The article focuses on exceptionally fast-growing mathematical sequences that surpass traditional exponential growth and challenge foundational axioms in arithmetic. It highlights the Goodstein sequence, which grows faster than Peano arithmetic’s usual limits yet eventually terminates, illustrating Gödel’s incompleteness theorem by requiring axioms beyond Peano’s for its proof. The discussion extends to the graph minor theorem, a major result in structural graph theory, whose proof demands even stronger axiomatic systems involving complex sets, revealing profound logical depth arising from simple graph structures. These discoveries underscore ongoing research into the boundaries of mathematical logic and the complexity inherent in seemingly elementary numerical and combinatorial processes. [Extracted from the article] |
| Copyright of New Scientist is the property of New Scientist Ltd. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | The article focuses on exceptionally fast-growing mathematical sequences that surpass traditional exponential growth and challenge foundational axioms in arithmetic. It highlights the Goodstein sequence, which grows faster than Peano arithmetic’s usual limits yet eventually terminates, illustrating Gödel’s incompleteness theorem by requiring axioms beyond Peano’s for its proof. The discussion extends to the graph minor theorem, a major result in structural graph theory, whose proof demands even stronger axiomatic systems involving complex sets, revealing profound logical depth arising from simple graph structures. These discoveries underscore ongoing research into the boundaries of mathematical logic and the complexity inherent in seemingly elementary numerical and combinatorial processes. [Extracted from the article] |
|---|---|
| ISSN: | 02624079 |
