Computability Theory

topic on 1 show · 1 statements across 1 episodes

the Y Combinator Startup Podcast

1 statements about Computability Theory, every show

Y COMBINATOR 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

← every entity, every show

Made with StarZero

Turn any episode into a week of clips.

This entire site, thousands of episodes across every show 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.