3 ms·
Seems like it wouldn't be Turing complete if you couldn't make an infinite loop
by kevinwang 3y ago
Seems like it wouldn't be Turing complete if you couldn't make an infinite loop
- kmill 3y agoYep. Still, it turns out there's a lot you can do with non-Turing-complete languages, and it's nice knowing that a program will definitely finish.