# Can we prove that a time machine is impossible using the Halting Problem?

Let us take a hypothetical machine i which halts on the ith day of the month if it rains on the ith day of the month. Basically it describes the present.

If we put this machine in a Halting Machine it should say whether the machine would halt. i.e. whether it would rain on the ith day of the month.

Since the Halting Machine is not possible, a time machine is not possible.

Is there any fault in my reasoning?

• I suggest an introductory book to computability theory. Popular descriptions are apparently not good enough. – Yuval Filmus Feb 25 '17 at 2:31