0 votes 0 votes Choose the correct statements. A total recursive function is also a partial recursive function A partial recursive function is also a total recursive function A partial recursive function is also a primitive recursive function None of the above Theory of Computation nielit2017oct-assistanta-cs theory-of-computation recursion + – admin asked Apr 1, 2020 • edited Aug 29, 2020 by soujanyareddy13 admin 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Primitive recursive functions are a class of functions that are defined using composition and primitive recursion They are a strict subset of those p-recursive functions (also called partial recursive functions) which are also total functions. Primitive recursive functions form an important building block on the way to a full formalization of computability. A total recursive function is also a partial recursive function. OPTION A Mohit Kumar 6 answered May 2, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.