Now showing items 1-1 of 1

    • On the reducibility of function classes 

      Podnieks, Karlis (Latvia State University, 1972)
      N – the set of all natural numbers, F – the set of all total functions N→N, A, B<=F. We say that A is m-reducible to B (A<=m B), iff there is a recursive operator M such that f in A, iff M(f) in B for all f in F. Similarly, ...