News for hackers. Stuff that matters.
Re:Surprisingly Turing-Complete by marcosdumay on Friday October 02, 2015 @04:26PM (#10321078)
Well, I shrug to think about how people would create a program that runs for an indeterminate time (that's most useful ones) in a coinductive total language. Yes, in practice it must be possible.

Then, total languages are just a subset of the non TC languages, and those are as prone to accumulating technical debit as TC languages. For avoiding technical debit, one needs something much less expressive.

There are no comments on this comment yet.