Unlocking the Mystery of Impossible Proofs in Complexity Theory 🧩

If I asked you to represent the square-root of two as a fraction or if I asked you to name the largest prime number, then possibly after a bit of thought, you will say "that is impossible!". In mathematics, it is not enough to claim that something is impossible, but you should also prove it.

I will take a computational view towards proofs of impossibilities and introduce you to some concepts from a fascinating area of Theoretical Computer Science called Complexity Theory.