Y
Hacker News
new
|
ask
|
show
|
jobs
by
thisjepisje
3290 days ago
You can implement decision tables on top of a turing-complete language.
1 comments
Animats
3290 days ago
You can't be sure they're implemented properly. Or what if they run out of "fuel"? Like the DAO's code.
It's not enough that contracts execute. They have to be amenable to audit.
link
It's not enough that contracts execute. They have to be amenable to audit.