Green function | Graph of a function | Hash function | Schur function | Riemann zeta function | Dirac delta function | Bessel function | Monotonic function | Lateralization of brain function | function (mathematics) | Cryptographic hash function | Linear function | hash function | Gaussian function | function | Euler's totient function | Domain of unknown function | continuous function | Wave function | Quadratic function | Meijer G-function | Massieu function | Lyapunov function | Lambert W function | Gamma function | Function block diagram | Feigenbaum function | Continuous function | Computable function | Analytic function |
The Entscheidungsproblem, proposed by David Hilbert, asked whether there is an effective procedure to determine which mathematical statements (coded as natural numbers) are true.
Computable function, or total recursive function, a function computable by a Turing machine
His work focused on computer science in the last decade of his life and in May 1962 he published one of his most famous results in the Bell System Technical Journal: the Busy Beaver function and its non-computability ("On Non-Computable Functions").