[londons_explore]

Turing completeness relies on infinite state.

With finite state, one could theoretically brute force search every possible 1D sequence to find a glider shorter than the one discovered here.

Obviously that's impractical, but turns the whole thing into a search problem - find the best/a good solution in a huge search space.