This Computer Science Paper is (Probably) Hilarious

Here we look at a "paper" from theoretical computer science and complexity theory called "Lower Bounds for Probably-istic Polynomial Time", and give my reactions to it. This paper is purely for fun, and I give my reasoning of why it is humorous, and where all of the original ideas come from.

Thanks to the following supporters of the channel for helping support this video. If you want to contribute, links are below.
Dolev Abuhazira, Josh Hibschman, Micah Wood, Morgan Jones, Patrik Keinonen, Simone Glinz, Tao Su, Timothy Gorden, unit220, Valentine Eben

Merch:

▶SEND ME THEORY QUESTIONS◀

▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.