The Ledger

Every statement that passed quotation and attribution checks. Mix any filter with any other: certainty 1/5, debate potential 5/5, or both at once.

clear all ✕

why aren't all 5 resolved? a statement only gets an assessment when the public record can support or contradict it. opinions and what-ifs never can, and 0 checkable ones are still open, waiting for their date. predictions held up or didn't; assertions are supported or contradicted. on every card: ▮▮▮▮▮ certainty · ▮▮▮▮▮ debate potential. speakers are clickable

Assertion Supported
Aaronson: Differential privacy and quantum shadow tomography share a mathematical connection
“There's a, you know, precise mathematical connection between these two problems. You can prove it. You know, it goes in both directions, and then we were actually able to use it to, you know, take work that's been done in differential privacy by people who don…”
Scott Aaronson Jun 29, 2018 ▶ 29:46 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
Assertion Supported
Aaronson: Holographic bulk-boundary mapping is a quantum error-correcting code
“The mapping between the bulk theory and the boundary theory in recent years, people realize that it is literally an example of one of these quantum error correcting codes that I talked, told you about before.”
Scott Aaronson Jun 29, 2018 ▶ 38:52 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
Assertion Supported
Aaronson: Snowden documents revealed NIST pseudorandom standard was NSA-backdoored
“In fact, you know, NIST did have a standard for pseudorandom bits, which we learned a few years ago because of the Snowden documents was backdoored. By most likely by the NSA, right?”
Scott Aaronson Jun 29, 2018 ▶ 15:02 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
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
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
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.