3 ms·
I'm wondering if the matrix method is powerful enough for this particular problem. What do we know about the class of terminating rewriting systems that are so
by praptak 6y ago
I'm wondering if the matrix method is powerful enough for this particular problem.
What do we know about the class of terminating rewriting systems that are solvable by translation to matrixes of size n? Is there a known terminating system that does not have a matrix solution? Or maybe at least a proof that such a system exists?
- auggierose 6y agoI am also wondering about that. I guess it is just one way to prove termination, it might be the case that this approach does not work for the Collatz conjecture.
- praptak 6y agoThere definitely exist rewriting systems where no size of a matrix works. String rewriting is in general undecidable, so matrices, being enumerable, can't prove every system.