Discussion
Which of the following is a partial recursive function ?
Answer: D
The answer is All of the above.
Post systems, the λ-calculus (printed 'x-calculus') and the random access machine (RAM) are each a model of computation that computes exactly the partial recursive functions, the same class a Turing machine computes. Their equivalence is the basis of the Church-Turing thesis.
So none of the three is singled out: each is an equivalent formulation of partial recursive computation, and choosing just one leaves out the other two.
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