3 ms·
This seems like a great task as a test for AI. The result is easily verify-able, yet the techniques to design such a glider are very complex and some might not
by londons_explore 11mo ago
This seems like a great task as a test for AI.
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.
- culi 11mo agoIt's already being done. Has been done for decades now. Definitely wouldn't be a good use of an LLM-type model if that's what you're proposing 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 [0] https://www.scimagojr.com/shapeofscience/ https://www.scimagojr.com/shapeofscience/
- btilly 11mo agoYou can change "might not" to "have not". 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.
- londons_explore 11mo agoTuring 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.
- Jaxan 11mo ago“Easily verifiable”… Not really, you have to simulate 133_076_755_768 steps. Sure it’s doable. But if the AI suggests a thousands patterns, then it will be useless.
- vrighter 11mo agoThis is specifically a task that LLMs would be utterly useless at. Because they can't execute loops.