What can and cannot be done with Diophantine problems

This survey presents various theorems (obtained mainly by specialists in mathematical logic and computability theory) stating the impossibility of algorithms for solving certain Diophantine problems. Often the technique developed for obtaining such “negative” results also allows one to prove many “positive” theorems on the possibility of formulating Diophantine problems with special properties. This survey also lists a number of questions that remain open.