This is a red herring. All computers are finite, but expressiveness still radically distinguishes different families of languages, and so computer scientists have always spoken in terms of programming languages that running on finite machines as Turing-complete vs. lesser kinds.
![Anthony Lusardi 🍕🥯 ₯ [#DePi #NGU]](https://pbs.twimg.com/profile_images/1160993052460273664/9pJ7ybut_normal.jpg)
-
-
Absolutely agreed. That argument was against Turing completeness in any application. Though somewhat related, I'm very cautious about taking full advantage of Turing completeness on chain because the resources are so limited.
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.