3 ms·
It's a turing machine -- it potentially never halts / repeats. Hashlife isn't just about exponential time-stepping, though that's a major part of it -- it's als
by addaon 4y ago
It's a turing machine -- it potentially never halts / repeats. Hashlife isn't just about exponential time-stepping, though that's a major part of it -- it's also about isolating periodic portions of the grid for memoization and speed-up, without requiring that the entire grid be periodic. All said, it really is a specific insanely high generation here.
- taneq 4y agoIt's deterministic, though, so once it detects a repeated global state it will cycle endlessly so you're not calculating generation N, you're calculating generation firstOccurrence+N*cycleLength for all N. At least, this line from the wiki reads to me like this is what's happening: > Computed by detecting a repeating cycle in the pattern, and skipping ahead to any requested generation.
- addaon 4y agoYes. But if the automaton being modeled implements a non-terminating turing machine, there is never a repeated global state.