3 ms·
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
by mikewarot 2y 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.
- krisoft 2y agoBut 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.
- TimSchumann 2y agoWouldn’t this also imply a lack of Turing completeness, and thus not be good for general purpose computing?