Hacker News new | ask | show | jobs
by mikewarot 638 days ago
Think of it as unwinding a program all the way until it's just a list of instructions. You can know exactly how long that program will take, and it will always take that same time.
2 comments

But will it always solve the task? Because without that it it is trivially easy to “solve” the halting problem by just declaring that the turing machine halts after X steps.
Wouldn’t this also imply a lack of Turing completeness, and thus not be good for general purpose computing?