That's not enough, you should include a cache layer which key is the neighbor memory state of length 2k (give or take) and the instruction pointer. You can then

That's not enough, you should include a cache layer which key is the neighbor memory state of length 2k (give or take) and the instruction pointer. You can then simulate at most k instructions at once when hit, a steady improvement over non-cached verseion!