Church's thesis says that 'every effectively computable function is recursively computable'.

The meaning of the statement is clear enough. In more simpler words, it says that every function that have an algorithm is computable by Turing machine.

My question is that what is this statement and where does it come form? I mean, is that a mathematical statement? Is there any 'mathematical proof' for that?

Thanks