University of Cambridge > Talks.cam > Rouse Ball Lectures > Undecidability in number theory

Undecidability in number theory

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Ivan Smith.

Hilbert’s tenth problem asked for an algorithm that, given a multivariable polynomial equation with integer coefficients, would decide whether there exists a solution in integers. Around 1970, Matiyasevich, building on earlier work of Davis, Putnam, and Robinson, showed that no such algorithm exists. But the answer to the analogous question with integers replaced by rational numbers is still unknown, and there is not even agreement among experts as to what the answer should be.

This talk is part of the Rouse Ball Lectures series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity