5 ms·

Yes, I think it is like that.

• SilasX 10y ago
  Another way to enumerate oracles is to consider the set of terminating Turing machines (and enumerating them is itself uncomputable but whatever). Each TM corresponds to an oracle that computes its result in O(1).
  • nialv7 10y ago
    This is not true. You can have oracles for uncomputable problems, like oracle for the halting problem.