Note that the code is being run halting oracle hypercomputer
So? I’m not allowed to actually use the oracle. It’s just used to make sure my program halts.
which simplifies your strategy to strategy number two.
No. Strategy number two has an upper bound for how high it can answer, where mine does not. For example, it may be that you reach a program that does not halt before you reach one that takes TREE(3) steps to halt. In fact, I’m pretty sure you will. Second, strategy two is highly likely to fail due to reaching an obviously unhalting program. My version would not do so.
This was supposed to be an improvement on strategy two.
So? I’m not allowed to actually use the oracle. It’s just used to make sure my program halts.
No. Strategy number two has an upper bound for how high it can answer, where mine does not. For example, it may be that you reach a program that does not halt before you reach one that takes TREE(3) steps to halt. In fact, I’m pretty sure you will. Second, strategy two is highly likely to fail due to reaching an obviously unhalting program. My version would not do so.
This was supposed to be an improvement on strategy two.