Also, it compiles with 0 Errors, and 0 Warnings.
Topic: [ANN][XEL] Elastic Project - The Decentralized Supercomputer - page 203. (Read 450523 times)
November 29, 2016, 02:21:47 PM
Current code base (0.8.0) has a defect density of 0.00
Also, it compiles with 0 Errors, and 0 Warnings.
Also, it compiles with 0 Errors, and 0 Warnings.
November 29, 2016, 07:39:37 AM
hope it will be faster than lisk 
I have noticed a strong correlation between website beautifulness and the speed of progress, so I am very confident here ;-)
that's a nice point!
November 29, 2016, 04:58:31 AM
hope it will be faster than lisk
I have noticed a strong correlation between website beautifulness and the speed of progress, so I am very confident here ;-)
November 29, 2016, 03:05:17 AM
date launch?
we expect to mature Elastic-Core.. its on testnet now, testing..testing..testing... November 28, 2016, 06:47:07 PM
date launch?
we expect to mature Elastic-Core.. its on testnet now, testing..testing..testing... November 28, 2016, 06:00:32 PM
date launch?
November 28, 2016, 05:11:55 PM
How many people are registered at the moment?
21 people yet....
please come here and please register as bitcointalk username
Support Slack Channel!
if u have some problems about auto invation, u can send me your email address with pm, i can invite u
November 28, 2016, 05:05:29 PM
How many people are registered at the moment?
November 28, 2016, 04:53:22 PM
November 28, 2016, 04:38:34 PM
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:
Code:
int a = 1;
for(int i=0;i<75000000000001;++i){
a = a + i;
}
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.
Not to nitpick here, but couldn't you rebuy the same ETH over and over? It won't get burned, someone will get it and that person will probably throw it on the market again.
I still get your point though.
November 28, 2016, 04:37:36 PM
If you want to install Elastic go to http://www.elastic-project.com/installing_and_running_elastic
The current git version will fail at the moment. But some changes were necessary to bump the miner speed by another 5x
This! is the development soul that I like. Do your work, don't bother pointless posts. Just be sure to set some deadline for mainnet. Could be 6 months from now but we need some deadline for people. I hope you understand that @EK.
November 28, 2016, 04:23:43 PM
If you want to install Elastic go to http://www.elastic-project.com/installing_and_running_elastic
The current git version will fail at the moment. But some changes were necessary to bump the miner speed by another 5x
November 28, 2016, 03:47:52 PM
If you want to install Elastic go to http://www.elastic-project.com/installing_and_running_elastic
November 28, 2016, 03:40:16 PM
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:
Code:
int a = 1;
for(int i=0;i<75000000000001;++i){
a = a + i;
}
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.
November 28, 2016, 02:24:40 PM
How can someone do donate, if network has not yet been launched? Or is there some mechanism to send and trade?
there was a presale or crowdfund
November 28, 2016, 09:49:10 AM
How can someone do donate, if network has not yet been launched? Or is there some mechanism to send and trade?
November 28, 2016, 05:42:36 AM
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)
November 28, 2016, 05:12:39 AM
maybe we can set up fundation - XEL Fundation, with our's donation.
If everybody donate 10-20% of shares we can set up fundation (evil-knievel + .... + 1-2 forum members (who helps the dev's the most)
p.s. - i dont have much (about 106000 XEL) but i will donate 20%
If everybody donate 10-20% of shares we can set up fundation (evil-knievel + .... + 1-2 forum members (who helps the dev's the most)
p.s. - i dont have much (about 106000 XEL) but i will donate 20%
November 28, 2016, 04:58:14 AM
Great to see Elastic coming closer to launch.
Just wondering: How does Elastic go about the halting problem?
It is a turing-complete network, right?
what's halting problem ?Just wondering: How does Elastic go about the halting problem?
It is a turing-complete network, right?
We have no conditional loops, or jumps so there is no "halting problem"!
Also, in ElasticPL we cannot store unlimited amounts of memory, its limited to 64000 ints, so by definition Elastic cannot be Turing complete!
November 28, 2016, 02:33:49 AM
When does this coin launch?
Jump to: