It sounds like you’re conflating the state of the cellular automaton with state of the Game of Life. The GoL isn’t NOOPing every other generation, only the CA is.

All Turing complete languages are equivalent, so if one is capable of omniperiodicity then they all are. A routine that cycles i times for any integer i is omniperiodic, and beginning developers learn how to do that with a modulo function.