Tue Aug 25
3pm 67- 442
Abstract: Hilbert's tenth problem asks for an algorithm for determining the existence of integer roots of multivariable polynomials with integer coefficients. In 1970, by building on the earlier work of Davis, Putnam and Robinson, Matiyasevich showed that no such algorithm exists. This result was proved by relating the tenth problem to undecidability results in computability theory. In this talk I will discuss some of the concepts and consequences of the proof. I will also discuss progress on some related problems.
All welcome! |