Yes, there is a big difference between how complex something can theoretically be, and how complex the typical use case is. There are two main drawbacks to acc

Yes, there is a big difference between how complex something can theoretically be, and how complex the typical use case is. There are two main drawbacks to accidental Turing-completeness: - You can no longer statically analyze the system for properties like termination, because you can't solve the halting problem (at least not without extra bounds). - Some people will try to abuse turing-completeness to solve their problem, leading to a jumbled mess. If this becomes an accepted way of using your system, it has basically failed.