The term "oracle" has a very specific definition in recursion theory and computational complexity theory, namely, a black box that can instantly compute a (possibly uncomputable) decision problem or function (not answer questions in natural language). I know this is just describing Bostrom's term, and maybe I'm just being nitpicky, but doesn't this kind of terminology signal a misunderstanding of CS concepts?
The term "oracle" has a very specific definition in recursion theory and computational complexity theory, namely, a black box that can instantly compute a (possibly uncomputable) decision problem or function (not answer questions in natural language). I know this is just describing Bostrom's term, and maybe I'm just being nitpicky, but doesn't this kind of terminology signal a misunderstanding of CS concepts?