Busy Beaver function

2 statements across 1 episodes · 0 bullish · 0 bearish · 1 people on the record · first statement Jun 29, 2018 by Scott Aaronson · across every show →

Everything said about Busy Beaver function, oldest first

Jun 29, 2018
Assertion Supported
Aaronson: Busy Beaver grows faster than any computable function
“The amazing thing about this function is that it increases more rapidly than any function that could be calculated by any computer program. This is provable, right? So you know, it is a ridiculously quickly growing function.”
Scott Aaronson Jun 29, 2018 ▶ 55:45 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
Jun 29, 2018
Assertion Supported
Aaronson: Set theory can only determine finitely many Busy Beaver values
“Axioms of set theory can only determine finitely many values of this function. Okay, so in some sense, beyond a certain point, you know, the standard rules of mathematics cannot even prove what are the values of this function.”
Scott Aaronson Jun 29, 2018 ▶ 57:42 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
Made with StarZero

Turn any episode into a week of clips.

This entire site, over 300 episodes transcribed, diarized, checked and made playable, runs on the StarZero media pipeline. Drop in your own episode and the podcast clipper finds the moments worth sharing, cuts them, captions them, and reframes them for every feed.