Compilers can "avoid" the halting problem if the underlying language is not turing complete/ can express function totality. You can even express algorithmic co

Compilers can "avoid" the halting problem if the underlying language is not turing complete/ can express function totality. You can even express algorithmic complexity in a language. But it's a bit more complex than that, really. You will have a harder time saying "this loop will block the event system for longer than I'd like".