Comment by naniwaduni

It's pretty easy to come up with "algorithms" in the intuitive sense that are not Turing computable; just violate any of the finiteness constraints.

The fact that you might object to considering such procedures algorithms rests on the fact that the "thesis" is providing a definition.