Hilbert's Tenth Problem (HTP) asks for an effective algorithm to decide whether an arbitrary polynomial equation P(x1,…,xn)=0 (with integer coefficients) has integer solutions. This was finally solved by Matiyasevich in 1970 negatively. In this talk we review the history of HTP and also introduce its further developments including recent progress on HTP over number fields and the field of rational numbers.