I have a question on phrasing.
As we know, solidity is a Turing complete language.
The halting problem on a Turing machine is supposed to be undecidable.
However, a smart contract will always halt. It either completes or runs out of gas.
So, the evm is a Turing machine, runs a Turing complete language, but the halting problem is decidable.
So, is the evm a Turing machine? No? What’s the standard way to describe this sort of Turing machine that can halt?
[link] [comments]
You can get bonuses upto $100 FREE BONUS when you:
💰 Install these recommended apps:
💲 SocialGood - 100% Crypto Back on Everyday Shopping
💲 xPortal - The DeFi For The Next Billion
💲 CryptoTab Browser - Lightweight, fast, and ready to mine!
💰 Register on these recommended exchanges:
🟡 Binance🟡 Bitfinex🟡 Bitmart🟡 Bittrex🟡 Bitget
🟡 CoinEx🟡 Crypto.com🟡 Gate.io🟡 Huobi🟡 Kucoin.
Comments