joeyh

joeyh at

Not actually true that all computer languages become turing complete in time. For example, I understand that Coq and Agda can intentionally only be used to write programs that can be proven to halt. So, unless the halting problem is solved, they're not turing complete, though still useful.

I think CSS should be a less-hifalutin' instance of the same thing, ideally. Turing tarpits and all that.

Mike Linksvayer, Claes Wallin (韋嘉誠), Christopher Allan Webber likes this.