Ah, and Even if Vitalik claims differently, the "Ethereum-Computer" is not Turing complete either. It's just that every body keeps repeating it, but even the non-scientific eye would immediately see a Turing machine that cannot be simulated by Ethereum, so by definition it cannot be Turing complete (see Turing equivalence)
Adding two number in Ethereum costs 10 GAS,
Now, we have a default gas price of 0.02µETH = 0.00000002 Ether.
So every addition of two numbers costs 0.0000002 Ether in gas.
Now let T be the turing machine, that represents what we see here in C logic:
int a = 1;
for(int i=0;i<75000000000001;++i){
a = a + i;
}
Failarmy! This is where Ethereum proves its Turing-Incompleteness:
This program would require exactly 15000000.0000002 ETH in gas fees, but there will only be 15000000 ETH ever in existance. There is no way to execute this turing complete program in Ethereum, even if you had ALL COINS IN EXISTENCE.
How can something be Turing Complete if you cannot execute the simple turing complete example from above? Remember, Turing Completeness means, you can execute EVERY SINGLE program that can be executed on a turing machine.
