3 ms·

Any program running on a Turing machine is subject to the halting problem. You may very well find a bug or feature that causes such a program to stop running or

Any program running on a Turing machine is subject to the halting problem. You may very well find a bug or feature that causes such a program to stop running or halt. This discovery still does not disprove the statement, that it is impossible to prove a program will not halt. Thus your observation does not flow logically.

EdHominem 10y ago
As pointed out, Ethereum is not infinite, thus not a Turing machine, and therefore does not exhibit a "halting problem". There's a limit to the number of "cycles" spent on each program in proportion to how much funding they have. It's like a smaller version of the halting problem where you only have to say if a program will halt in five seconds or not. Turing machines are a theoretical construct, be careful when trying to reason about the real world based on them.