Computability with two-place oracle
A kind of Turing machine which can use partial functions as an oracle is discussed. For such a machine with a partial oracle \(F\), the function of the halting problem \(g_F(x)\) is defined as 0 or 1 if the machine halts or works endlessly, respectively, and for any question asked by the machine, the oracle gives the answer. If the oracle does not give an answer to some question (because the oracle is partial), \(g_F(x)\) is undefined. The main result of this paper indicates that there are partial oracles \(F\) for which the function \(g_F\) is \(F\)-computable.
- scientific article; zbMATH DE number 1191231
- Computability with an oracle in both classical and alternative infinity
- Computations with oracles
- On a certain nontraditional version of computations with oracles
- Generalized computations with oracles
- scientific article; zbMATH DE number 4079399
- Generalized computations with binary oracles
- scientific article; zbMATH DE number 6731539
- Computational complexity with experiments as oracles
- Computable Dowd-type generic oracles
This page was built for publication: Computability with two-place oracle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920828)
