×

Computability in type-2 objects with well-behaved type-1 oracles is \(p\)-normal. (English) Zbl 1005.03043

Extending his previous work, the author presents a notion of computability relative to a type-2 functional. He then sketches a proof of the computability of the functional that compares computation lengths.

MSC:

03D65 Higher-type and set recursion theory
PDFBibTeX XMLCite