• Publications
  • Influence
Strong and weak reducibility of algorithmic problems
tl;dr
M-problems (families) A and B are solvable if there exists a general method of transformation of any solution of the M-problem P( A)into a solution of P( B), or more accurately, a partial recursive operator that transforms each function f from the family A into some function g (which depends on f ) from thefamily B. Expand
  • 13
  • 1