Hilbert's Tenth Problem over Q and its subrings


Bjorn Poonen

University of California, Berkeley


Thursday, May 15, 2003

Talk at 4:30 p.m. in Room 2-190

Tea from 4:00 - 4:30 p.m. in Room 2-290
Refreshments afterwards, in Room 2-290


Abstract:   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. In 1970, Matijasevic, building on earlier work of Davis, Putnam, and Robinson, showed that no such algorithm exists. But the answer to the analogous problem with Z replaced by Q is still unknown, and there is not even agreement among experts as to what the answer should be. Attempts to prove a negative answer have come into conflict with conjectures of Mazur on the ``topology of rational points.''


Home Web page:  Alexandru I. Suciu Comments to: 
Posted: March 30, 2003    URL: