Abstract
Definition 1. An M-problem P( A)(family A )i sreducible to an M-problem P( B)(family B), if there exists a general method of transformation of any solution of the M-problem P( B)into a solution of the M-problem P( A), or more accurately, if there exists a partial recursive operator T , which transforms each function f from the family B into some function g (which depends on f ) from the family A, g = T [f ]. The reducibility of the family A (M-problem P( A)to P( B) )t oB is denoted by A B ( P( A) P( B)). The family of functions A (the M-problem P( A)) 3 is called solvable, if it contains at least one general recursive function. The M-problems (families) A and B
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
