Computability relative to a partial function f on the natural numbers can be formalized using notion of an oracle for this f. This generalized arbitrary combinatory algebras, yielding ‘adjoining algebra A’. A similar construction is known second-order functionals, but third-order case more difficult. In paper, we prove several results case. Given functional Φ A, show how construct A[Φ] where ‘c...