Turing machine premature rejection
Description of the bug
The following machine contains an infinite loop and an unreachable final state (with this specific input). When tracing through this, the machine rejects after hitting the same state twice.
I understand this is likely caused by cycle detection, but to the average user it may be unclear why this particular machine rejects in this instance, as it is treated like there are no transitions from this state
To reproduce
Expected behavior
For single stepping, I feel that it'd make sense to just continue forever, so the user can actually see the behaviour (this was my use case)
- I believe currently we simulate the entire computation even to step once, but given that the transition was deterministic we wouldn't necessarily need to do that, which would solve the problem in question
Simulating the whole thing would be a different challenge. I believe there was another issue about warning the user that there are x paths that are being computed and having the user confirm the computation
Additional information
No response