Harry's universe may not be Turing computable in the absolute sense assuming that arbitrary time travel is possible, but with even minor limits you can come up with algorithms that largely work, or will work most of the time.

As an example, run the simulation forward taking snapshots at every point until a backward looking event occurs. Take the snapshots of the two time periods and brute force search for a solution (any solution) that can link the two time periods together without breaking constraints. If a solution is found, throw all the intermediate snapshots away and replace them with the found solution. Otherwise, keep the existing data and fail the time travel event in some fashion.

My understanding is that it is possible to find solutions to these kinds of problems (otherwise we wouldn't know and busy beaver numbers.) It's just not possible to find them via some general, easily computable algorithm.