JOURNAL ARTICLE

Revealing the edge of maths.

  • Published In: New Scientist, 2025, v. 267, n. 3552. P. 17 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Padavic-Callaghan, Karmela 3 of 3

Abstract

The article focuses on the exploration of the Busy Beaver numbers, particularly the sixth number in the sequence, BB(6), which is being pursued by amateur mathematicians. The Busy Beaver function, which describes the longest run-time of Turing machines with a given number of states, grows at an extraordinary rate, with BB(5) recently determined to be 47,176,870. The current efforts, led by an online community known as the Busy Beaver Challenge, have established that BB(6) is at least as large as a number that requires advanced mathematical concepts beyond exponentiation to describe. This research not only seeks to uncover the value of BB(6) but also aims to deepen the understanding of fundamental mathematical theories, including those proposed by Alan Turing and Kurt Gödel, regarding the limits of computability and mathematical proof. [Extracted from the article]

Additional Information

  • Source:New Scientist. 2025/07, Vol. 267, Issue 3552, p17
  • Document Type:Article
  • Subject Area:History
  • Publication Date:2025
  • ISSN:0262-4079
  • Accession Number:186697828
  • Copyright Statement: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.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.