But if you remove the word "Turing" it is no longer a theorem. It becomes a thesis because we don't have a definition of what it means to be computable. It is in fact an innovation of Turing to identify computable with Turing computable, but that's by no means universal.
So you could completely ignore the recursive functions part (and so, Church's Thesis) and there would still be the same sort of lay confusion about the computability thesis.
The statement F=ma is either a definition, axiom or theorem depending on what context you're working in. There are more fundamental (empirically tested) axioms that have F=ma as a consequence. Unless you introduce special relativity, then it becomes false.
From http://mathworld.wolfram.com/Church-TuringThesis.html
There has never been a proof, but the evidence for
its validity comes from the fact that every
realistic model of computation, yet discovered,
has been shown to be equivalent.
http://people.seas.harvard.edu/~salil/cs121/fall12/lecnotes/... The Church–Turing Thesis is an extramathematical
proposition, not subject to formal proof.