0 votes 0 votes Theory of Computation theory-of-computation descriptive + – sh!va asked May 27, 2016 sh!va 1.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The difference is that partial recursive functions are partial functions. A partial function f:A⇀ B (note the special arrow!) is a function that is, in fact, a function f:S→B where the domain S is a subset of A. For all values in A∖S we have that f is undefined. If S=A we say that the function is a total function. a primitive recursive function is a partial function. Source : https://www.quora.com/What-is-the-difference-between-recursive-functions-and-partial-recursive-functions pps121 answered Nov 30, 2018 pps121 comment Share Follow See all 0 reply Please log in or register to add a comment.