Infinite Computational Functions

Hilbert challenged mathematicians to formulate a rigorous theory of what constitutes a proof. Computations, as understood in shearing's theory, are essentially the same thing as proofs. Almost all mathematical functions that exist logically cannot be computed by any programme. They are non computable for the same reason that most logically possible. All undecidable statements are directly or indirectly, about infinite sets.