Is the Internet Secure?

Data Skeptic

NOTE: Since recording this episode, I've come to realize that I made some mistakes in the computation theory. The complexity classes are more nuanced that I understood at the time. In fact, not only is factorization not NP-complete, factoring itself is fundamentally different from NP-complete problems in that there is some ordering to it that can be exploited algorithmically. I'll do a better follow up at some point in the fut

Next Episodes


Data Skeptic

The t-test @ Data Skeptic

📆 2014-10-17 02:00



Data Skeptic

Contest @ Data Skeptic

📆 2014-10-08 02:00


Data Skeptic

Selection Bias @ Data Skeptic

📆 2014-10-03 02:00