I am aware that this is not a decision algorithm. I said in my original comment that the set is recursively enumerable, and I also said that the algorithm will not terminate on true oracles. That is, we can list the fake oracles, but we cannot decide on the fake status of an oracle in finite time. This is what recursively enumerable means: http://en.wikipedia.org/wiki/Recursively_enumerable_set.
If there is such a method, it has to get around cousin_it’s argument below. I believe you can only enumerate fake oracles, not answer if an oracle is fake or real, in finite time.
This is not a decision algorithm: if the oracle actually is real, your program will never terminate.
Edit: I guess you realize this already, but there are a few confused comments from other people here, so I will not retract this.
I am aware that this is not a decision algorithm. I said in my original comment that the set is recursively enumerable, and I also said that the algorithm will not terminate on true oracles. That is, we can list the fake oracles, but we cannot decide on the fake status of an oracle in finite time. This is what recursively enumerable means: http://en.wikipedia.org/wiki/Recursively_enumerable_set.
This is different from “recursive” (http://en.wikipedia.org/wiki/Recursive_set) where we can decide on membership in finite time.
I’m pretty sure that there is a method to determine the fake status of any oracle in finite time.
If there is such a method, it has to get around cousin_it’s argument below. I believe you can only enumerate fake oracles, not answer if an oracle is fake or real, in finite time.
Right.