Q1: To Bytemaster: Have you had a chance to look at the "EarnBitshares" proposal and if you did what do you think?
Q2: To Bytemaster: Several researchers now believe Ethereum took the wrong direction on "Turing completeness". Is it possible that you might reverse your choice on "Turing completeness" for smart contracts in light of the fact that Turing completeness is undecideable logic, and as a result not verifiable?
Some background for readers
Turing complete means that your software could run on a computer with infinite resources. Turing incomplete means that your software can run on a computer with finite resources, but for all practical purposes there is no possibility of building a computer which computes with infinite resources, so there doesn't seem to be a real practical benefit to Turing completeness, while at the same time there are security costs due to the undecideability.
Decideable smart contracts have major security benefits when you want to outsource computation. A decideable smart contract allows for verifiable computing, a kind of computing where programs are formally proven, and are guaranteed to be correct. This kind of computing allows the outsourcing of computation, and it resolves the security issues around smart contracts.
Decidability will be a key feature for future blockchain technologies.
https://simple.wikipedia.org/wiki/Turing_completehttps://en.wikipedia.org/wiki/Verifiable_computinghttps://en.wikipedia.org/wiki/Agda_(programming_language)
https://eprint.iacr.org/2009/547.pdf