Hacker News new | ask | show | jobs
by adilparvez 3506 days ago
Yes, I think it is like that.
1 comments
SilasX 3506 days 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).
link
nialv7 3506 days ago
This is not true. You can have oracles for uncomputable problems, like oracle for the halting problem.
link