Suppose my decision algorithm is: I obtain the source code of Omega and run its prediction algorithm to determine what it predicts I will do, and then do the opposite of that.
This would be kind of like the proof that the halting problem is non-computable.
Maybe perfect prediction is impossible, too.
Certainly perfect prediction is impossible in some cases. Look at the halting problem in computer science.
Suppose my decision algorithm is: I obtain the source code of Omega and run its prediction algorithm to determine what it predicts I will do, and then do the opposite of that.
This would be kind of like the proof that the halting problem is non-computable.