3 ms·
Let's be snarky a bit: Can you do a neural network that, given a starting position of the game of life, decides if it cycles or not? ;) Ok, not cycles... dies
by nottorp 2y ago
Let's be snarky a bit:
Can you do a neural network that, given a starting position of the game of life, decides if it cycles or not? ;)
Ok, not cycles... dies, stabilizes, goes into a loop etc.
- GrantMoyer 2y agoSo Oracle's working on an LLM too, eh?
- DeathArrow 2y agoEverybody and their mom are into LLMs.
- nottorp 2y ago<cough> halting problem. But now I'm spoiling it.
- markisus 2y agoWe know neural networks cannot solve the halting problem. But isn’t the question whether they can learn the transition table for game of life? Since each cell depends only on neighbors, this is as easy as memorizing how each 3x3 tile transitions.
- nottorp 2y agoThe original question, maybe. Mine is basically the halting problem, I think. The other difference is I don't take it seriously.
- theGnuMe 2y agoWolfram looked at this recently on his blog. https://writings.stephenwolfram.com/2024/05/why-does-biological-evolution-work-a-minimal-model-for-biological-evolution-and-other-adaptive-processes/ https://writings.stephenwolfram.com/2024/05/why-does-biologi... He says it's possible for smaller games (fewer rules) but unlikely for larger ones.. IMHO anything Turing complete would have this problem.
- catlifeonmars 2y agoFor a grid of a fixed size, yes.
- scarmig 2y agoThe halting problem doesn't mean you can never decide if something cycles etc, just that you can't always decide. As it stands, my guess is that the LLM would always confidently make a decision, even if it were wrong, and then politely backtrack if you pushed backed, even if it were originally right.