ace test series

Question

Algorithms and procedures are modelled by

A)Turing machines that may or may not halt on some inputs

B)Turing machines that always halts

C)Algorithms are modelled by general Turing machine and procedures by Turing machine that always halt

D)None of the above

Comments

what was their explanation ???

---

I think it should be $A$.

Ref - this.

---

@Shubhanshu i think knowing basic difference between algorithm and procedure is enough to decide that

: A procedure can go forever while an algorithm has well defined sequence of steps and it will eventually terminate. ... The main difference is that, the procedure can halt or need not halt. But the algorithm always halt and give you the output...

https://www.quora.com/What-is-the-difference-between-an-algorithm-and-a-procedure

which means D should be the answer.