1,550 views

1 Answer

0 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

Position:
Show:

Related questions

4 4 votes
2 answers 2 answers
3.2k
3.2k views
lowOnATP asked Jun 29, 2015
3,205 views
I mean if we run prim's algorithm on a weighted directed graph, will it give the same shortest path? And vice-versa?Also if we run dijkstra's algorithm on a graph with ne...
0 0 votes
0 0 answers
599
599 views
0 0 votes
2 2 answers
3.7k
3.7k views