3 ms·
Turing completeness is a red herring in this case. Even FSMs are not feasibly verifiable in general, so both the richest computational model and the most limite
by pron 10y ago
Turing completeness is a red herring in this case. Even FSMs are not feasibly verifiable in general, so both the richest computational model and the most limited can only be feasibly verified in specific cases. Some properties can make verification easier or harder, but Turing completeness or lack thereof is not among them. Insofar language or representation can help, some classes of simple bugs can be prevented with the right language, and a formalism that captures how people think of contracts may help, too (e.g. behavioral programming: http://www.wisdom.weizmann.ac.il/~bprogram/ http://www.wisdom.weizmann.ac.il/~bprogram/)
If anything, the problem is that contracts are a very complicated thing in the first place. Even rich formalisms would likely fail to account for all cases you want a contract to cover.
- Animats 10y agoIf you can handle purchases, loans, negotiable bills of lading, equity investments, and derivatives, you probably have the important use cases covered. Trying to support transactions of types not in standard business textbooks is excess functionality leading to bugs.
- woah 10y agoThe dao hack was the result of a textbook concurrency error, similar to errors that can result from not using database transactions. Crippling the language is not the answer. Just look at code that works with Bitcoin. It is convoluted beyond belief. Read the Lightning whitepaper. It's 60 pages of complex hacks to accomplish something that can be explained in 5 minutes (if you don't have to jump through the Bitcoin hoops), and implemented in a few hundred lines of ethereum code.
- Animats 10y ago"Crippling the language is not the answer. Just look at code that works with Bitcoin." Does anybody actually use the Lightning approach?