Increasing generality: finite automata < pushdown automata < linear bounded automata < Turing machines
-
@CompSciFact@NickSzabo4 hmmm. I analogise that smart contracts are 'state machines with money' but others want 'Turing machines with money'
. @iang_fc Woz could have stuck with pocket calculators, but the good news is he made a Turing machine (Apple) instead.
-
-
.
@NickSzabo4@iang_fc activeX/php/x86 or prolog/haskell turing completeness, tho that is the question. easy to be powerful hard to be safe. -
@adam3us@NickSzabo4@iang_fc The Bitcoin engineering experience has found non-turing-complete *less* robust than turing complete approaches -
@adam3us@NickSzabo4@iang_fc e.g. trying to do even really simple static analysis of sigops counts lead to a unfixable consensus-crit mess. -
@adam3us@NickSzabo4@iang_fc The question isn't if a system is "turing complete", but what's complexity of implementation and side effects?
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.