It From Bit - A Brief Exploration Of Some Ideas and Results From The Theory of Computation

A good friend of mine from the physics department recently asked if I would be interested in giving an informal talk at their biweekly talks for their graduate students talk series. The answer was of course yes. I decided to talk about some of the most interesting results in theoretical computer science: namely, models of computation, and their limitations, and the similarities of these results to results coming from mathematical logic such as Gödel's incompleteness theorems, or Cantor's proof about the cardinality of the power-set. The title is a reference to the John Archibald Wheeler quote.

Below is the presentation embedded. You can see it full-screen at It was prepared using the amazing HTML5 presentation framework reveal.js by Hakim El Hattab. (Which, by the way, embeds really easily using just a simple iframe!)