$1$

$6\mathrm{.}5$ points

What claim is the best summary of the Church$-$Turing thesis?

Any algorithm which can run on a turing machine will eventually come to a halt

The class of algorithms which can run on a turing machine and not on any other machine makes the turing machine the most useful model

Any problem which has an algorithmic solution can be de Quizzes $2$ run on a turing machine

A turing machine is not a complete model of computation, and instead showcases the fundamental limit of computers