There is a very simple counting argument that proves that not all functions are computable in the lambda calculus, or any programming language for that matter:
There are uncountably many functions.
There are only countable many lambda calculus terms.
Hence there exist functions without a corresponding lambda calculus term.
This is Cantor’s famous diagonal argument. It is taught in every theory of computation class.
So I’m curious what the contribution of your paper is?