Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

If it's a limited number of states in the automaton, and a limited amount of "tape" in the canvas, it's not a Turing machine, it's a Finite-State Automaton, which is easy to analyze for loops.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: