按年被提到
20182018 · 1 次2026
Self-Reproducing Coins as Universal Turing Machine
Alexander Chepurnoy, Vasily Kharin, Dmitry Meshkov · 2018
被提及 · 2 人首次 2018-08-30 · 最近 2022-12-19
2不同的人
2活跃月份
2讨论串
4被引(OpenAlex)
arXiv 摘要(候选层不写导读)
Turing-completeness of smart contract languages in blockchain systems is often associated with a variety of language features (such as loops). In opposite, we show that Turing-completeness of a blockchain system can be achieved through unwinding the recursive calls between multiple transactions and blocks instead of using a single one. We prove it by constructing a simple universal Turing machine using a small set of language features in the unspent transaction output (UTXO) model, with explicitly given relations between input and output transaction states. Neither unbounded loops nor possibly infinite validation time are needed in this approach.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
没有评论直接链到它;下面是它被提交的讨论串里回复最多的评论(不计入统计)讨论串里没有 ≥100 字的评论,只有提交记录。
被提交为 story · 2 次
- Self-Reproducing Coins as Universal Turing Machine ↗lainon · 2018-08-30 · 1 分
- Self-Reproducing Coins as Universal Turing Machine ↗GBiT · 2022-12-19 · 2 分