I didn’t think you were claiming that, I was merely pointing out that the fact that self-consistent solutions can be calculated may not be that surprising.
The Novikov self-consistency principle has already been invented; the question was whether there was precedent for “You can actually compute consistent histories for discrete universes.” Discrete, not continuous.
Yes, hence, “In computational physics”, a branch of physics which necessarily deals with discrete approximations of “true” continuous physics. It seems really quite similar, I can even give actual examples of (somewhat exotic) algorithms where information from the future state is used to calculate the future state, very analogous to your description of a time-travelling game of life.
I didn’t think you were claiming that, I was merely pointing out that the fact that self-consistent solutions can be calculated may not be that surprising.
The Novikov self-consistency principle has already been invented; the question was whether there was precedent for “You can actually compute consistent histories for discrete universes.” Discrete, not continuous.
Yes, hence, “In computational physics”, a branch of physics which necessarily deals with discrete approximations of “true” continuous physics. It seems really quite similar, I can even give actual examples of (somewhat exotic) algorithms where information from the future state is used to calculate the future state, very analogous to your description of a time-travelling game of life.