P. Odifreddi, Strong reducibilities, Bulletin of the American Mathematical Society 4 (1981), 37-86. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Characterizations of the Basic Feasible Functionals Part II - Irwin, Kapron, Royer (2002) (1 citation) (Correct)
....this machine, and the machines specified by its query indices, or the machines specified by the query indices of the machines specified by the original machine s query indices, and so on. The index e can be constructed through an application of an appropriate version of Kleene s recursion theorem [Rog67, Odi81, RC94]) through which we can arrange that the run time of (the machine named by) e on input (u, v) is no greater than a constant plus the run time of M# on (F, f, u, v) Clearly, M# computes #. Let us sketch an argument that it does so feasibly. simplicity, let us assume for the moment that our ....
P. Odifreddi, Strong reducibilities, Bulletin of the American Mathematical Society 4 (1981), 37--86.
On Characterizations of the Basic Feasible Functionals Part II - Irwin, Kapron, Royer (2002) (1 citation) (Correct)
....this machine, and the machines speci ed by its query indices, or the machines speci ed by the query indices of the machines speci ed by the original machine s query indices, and so on. The index e can be constructed through an application of an appropriate version of Kleene s recursion theorem [Rog67, Odi81, RC94]) through which we can arrange that the run time of (the machine named by) e on input (u; v) is no greater than a constant plus the run time of M on (F; f; u; v) Clearly, M computes . Let us sketch an argument that it does so feasibly. For simplicity, let us assume for the moment that our ....
P. Odifreddi, Strong reducibilities, Bulletin of the American Mathematical Society 4 (1981), 37-86.
On Characterizations of the Basic Feasible Functionals, Part II - Irwin, Kapron, Royer (2001) (1 citation) (Correct)
....a particular index for #u, v M# (F, f, u, v) More on this shortly. z : the result of querying the oracle for F on (e, x 1, w) If z # y then output z else output 0. End The index e can be constructed through an application of an appropriate version of Kleene s recursion theorem [Rog67, Odi81, RC94]) through which we can arrange that the run time of (the machine named by) e on input (u, v) is no greater than a constant plus the run time of M# on (F, f, u, v) Clearly, M# computes #. Let us sketch an argument that it does so feasibly. 11 For simplicity, let us assume for the moment that ....
P. Odifreddi, Strong reducibilities, Bulletin of the American Mathematical Society 4 (1981), 37--86.
On the Computational Complexity of Longley's - Functional James Royer (Correct)
....games r can be thought of as representing a decision tree. From a computability theoretic point of view, this is clear when one notices that given two total g 1 , g 2 : N # N, we have g 1 #T g 2 if and only if, for some partial recursive r, g 1 = r . g 2 . See Rogers [Rog67] or Odifreddi [Odi81] for a discussion of Turing reductions between total functions. Let B = N # N) and PR be the set of partial recursive functions over N. Van Oosten [vO99] first observed that (B, and (PR, are partial combinatory algebras. We refer to the sequence of interactions between r and g ....
P. Odifreddi, Strong reducibilities, Bulletin of the American Mathematical Society 4 (1981), 37--86.
On the Computational Complexity of Longley's - Functional James Royer (Correct)
....games r can be thought of as representing a decision tree. From a computability theoretic point of view, this is clear when one notices that given two total g 1 , g 2 : N # N, we have g 1 #T g 2 if and only if, for some partial recursive r, g 1 = r . g 2 . See Rogers [Rog67] or Odifreddi [Odi81] for a discussion of Turing reductions between total functions. Let B = N # N) and PR be the set of partial recursive functions over N. Van Oosten [vO99] first observed that (B, and (PR, are partial combinatory algebras. We refer to the sequence of interactions between r and g ....
P. Odifreddi, Strong reducibilities, Bulletin of the American Mathematical Society 4 (1981), 37--86.
On Characterizations of the Basic Feasible Functionals Part II - Irwin, Kapron, Royer (2002) (1 citation) (Correct)
No context found.
P. Odifreddi, Strong reducibilities, Bulletin of the American Mathematical Society 4 (1981), 37-86.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC