"Every effectively calculable function is a computable function" [1]
The definition is a little terse so we have to expand on what "effectively calculable function" and "computable function" mean.
By a "computable function", we mean a Turing machine. The term "effectively calculable function" is a little unclear but one definition that I think is the closest to the intent is "it can be done by a human without any aids except writing materials." [2].
In other words, the Church-Turing thesis is saying:
"All physically computable functions are Turing computable"
That is, the physical world, including human cognition, can be realized by a Turing machine.
While one formulation might be cast in terms of lambda calculus, this is hiding the underlying assumption that lambda calculus is used as a proxy to simulation of the physical world and, as a subset, human cognition, effectively saying "if it can do lambda calculus, it can do the physical universe and can do human cognition".
[1] https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis#S...
[2] https://en.wikipedia.org/wiki/Effective_method#Definition