Turing completeness is about Universality. If you take it formally, you'll want bitwise universality, not just universality up to some preprocessing, at which point you have Kolmogorov Universality... and none of the usual languages are universal, save Lisp, Perl and... shell(!)
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Look at the formal definitions of universality, as developed by Turing, Kolmogorov, Solomonoff or Chaitin: you have to be able to decode the rest of the input string as an *arbitrary* program. You can't have arbitrary bytes in a C file. C is therefore not universal.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Interesting... I've been thinking about creating a language for writing a "universal parser" that can munge any other language into a common AST. I thought it was a highly technical endeavor, but perhaps there's a way to pivot the product into a valuable business tool.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
Read my blog!