Abstract
We show that computability in a type-2 object is p-normal if type-1 partial inputs are computed by ``well-behaved oracles''.
Filter Results
Select search scope: search across all journals or within the current journal
Search this journal
Enter search terms…
/