|
|
|
|
|
|
by hiq
1287 days ago
|
|
|
> Solidity, which is not Turing complete From https://ethereum.github.io/yellowpaper/paper.pdf: "[The EVM] is a quasi-Turing-complete machine; the quasi qualification comes from the fact that the computation is intrinsically bounded through a parameter, gas, which limits the total amount of computation done." > By restricting semantics you have finer control over potential slippages. Solidity have had plenty of "slippages" already and a generally misguiding design, and at least initially was not really into "restricting semantics". Plenty of points made previously, e.g. https://news.ycombinator.com/item?id=14691212. |
|
|