View in EDS HTML Full Text

Breaking the speed limit.

Saved in:
Bibliographic Details
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.
FullText Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 193156429
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Breaking the speed limit. (cover story)
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Elwes%2C+Richard%22">Elwes, Richard</searchLink> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22New+Scientist%22">New Scientist</searchLink>. 4/25/2026, Vol. 270 Issue 3592, p38-41. 4p. 2 Color Photographs, 1 Cartoon or Caricature.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Incompleteness+theorems%22">Incompleteness theorems</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+sequences%22">Mathematical sequences</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+logic%22">Mathematical logic</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics+theorems%22">Mathematics theorems</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193156429
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 4
        StartPage: 38
    Subjects:
      – SubjectFull: Incompleteness theorems
        Type: general
      – SubjectFull: Mathematical sequences
        Type: general
      – SubjectFull: Mathematical logic
        Type: general
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Mathematics theorems
        Type: general
    Titles:
      – TitleFull: Breaking the speed limit.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Elwes, Richard
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 25
              M: 04
              Text: 4/25/2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 02624079
          Numbering:
            – Type: volume
              Value: 270
            – Type: issue
              Value: 3592
          Titles:
            – TitleFull: New Scientist
              Type: main
ResultId 1