Re: letstalkbitcoin on committed tx, homomorphic value, fungibility, privacy

I doubt it'll be Turing-complete, like Ethereum's, as that's likely overkill/window dressing.

I'm drinking wine and haven't looked into Ethereum at all, so please excuse me if I'm being ignorant, but even NAND gates and Rule #110 Wolfram Cellular Automaton are Turing complete, no? The complexity required for universal computation is surprisingly low.

Here's a recent discussion on this: https://bitcointalk.org/index.php?topic=431513.0

Thanks d'aniel. My initial feeling is that Turing-completeness is not necessary for bitcoin and would very likely lead to unforeseen problems and instability (mostly related to the halting problem). Money isn't a computer.