The result is easily verify-able, yet the techniques to design such a glider are very complex and some might not have been discovered yet.
The result is easily verify-able, yet the techniques to design such a glider are very complex and some might not have been discovered yet.
If you look at the placement of Journal of Cellular Automata in SciMago's Shape of Science visualization[0] you'll see that it's completely surrounded by machine learning/AI journals
The Game of Life is Turing complete. And therefore a complete analysis of how to write programs in it would imply a solution to the Halting problem. Which is impossible.
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.