Bonus

Alan Turing’s final publication concerns some numerical approximations for solving this problem, which he had earlier cited as a “number theoretic theorem” in his Ph.D. thesis. For 10 points each:
[10e] Name this unsolved problem that asserts that the real part of every non-trivial zero of the zeta function is one-half.
ANSWER: Riemann hypothesis [or RH]
[10m] The Riemann hypothesis is computationally equivalent to a Turing machine with 29 of these things halting. The input of the Busy Beaver function is the number of these things, which are denoted Q in the definition of a DFA.
ANSWER: states [or automaton states]
[10h] The equivalence arises from the DPRM theorem, which asserts that functions with this property can be written as Diophantine equations. Languages with this property are type 0 in Chomsky’s hierarchy, opposite regular languages at type 3.
ANSWER: recursively enumerable [reject “recursive”]
<MY, Other Science>

EditionsHeardPPBEasy %Medium %Hard %
16310.4868%37%0%

Back to bonuses

Conversion

TeamOpponentPart 1Part 2Part 3TotalParts
Chicago AChicago C1010020EM
Chicago BChicago D100010E
Illinois AMissouri100010E
Illinois BMissouri S&T1010020EM
Indiana AIllinois C1010020EM
WashU BWashU A0000

Summary

TournamentEditionHeardPPBEasy %Medium %Hard %
Florida2025-02-01310.0067%33%0%
Great Lakes2025-02-0166.6750%17%0%
Lower Mid-Atlantic2025-02-01610.0067%33%0%
Midwest2025-02-01613.3383%50%0%
North2025-02-01316.6767%100%0%
Northeast2025-02-01510.0080%20%0%
Overflow2025-02-01510.0060%40%0%
Pacific Northwest2025-02-0125.0050%0%0%
South Central2025-02-01220.00100%100%0%
Southeast2025-02-0142.5025%0%0%
UK2025-02-011014.0090%50%0%
Upper Mid-Atlantic2025-02-01810.0075%25%0%
Upstate NY2025-02-0136.6733%33%0%