It’s possible to think of Diophantine equations as computational devices, too. Consider the equation y = x2. It has infinitely many integer solutions. If you plug in different integers for x and solve for y, the values you get all belong to a famous set of integers: the perfect squares. It is easy to imagine a computer program (that is, a Turing
(
Read more... )