Undecidability and Hilbert's 10th Problem
Undecidability and Hilbert's 10th Problem

Jacob Tsimerman, Princeton University
Fine Hall 214
Hilbert's famous 10th problem asks whether there is a general algorithm to decide whether a polynomial in many variables has a solution. I will explain how Robinson, Davis, Putnam, and Matijasevic answered the question in the negative by proving a much more interesting theorem: that any listable set can be listed using a polynomial equation. I'll also give some awesome mindblowing consequences of this theorem, such as primeproducing polynomials! No background in anything will be required.