Discussion
Which of the following is not primitive recursive, but partially recursive ?
Answer: D
The function is the Ackermann function.
The Ackermann function is total and computable, so it is (partially) recursive in the sense of the general recursive or mu-recursive functions. But it grows faster than every primitive recursive function, so it cannot be built using only composition and primitive recursion. It is the standard example of a recursive function that is not primitive recursive.
The other names are not standard examples in computability theory, so they are ruled out.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development