This man showed that Lie groups could be approximated by finite groups and independently proved the central limit theorem using the Gaussian error function. His namesake "degree" is the level of unsolvability of a set of natural numbers, and this man posited that there is no way to determine whether a given program-input combination will terminate, thus showing the halting problem is undecidable. Computable functions can be computed by constructs like the "busy beaver" in a certain thesis named for Church and this man. For 10 points, name this British computer scientis
This man showed that Lie groups could be approximated by finite groups and independently proved the central limit theorem using the Gaussian error function. His namesake "degree" is the level of unsolvability of a set of natural numbers, and this man posited that there is no way to determine whether a given program-input combination will terminate, thus showing the halting problem is undecidable. Computable functions can be computed by constructs like the "busy beaver" in a certain thesis named for Church and this man. For 10 points, name this British computer scientist, the namesake of a test of computer intelligence and a set of machines on which that test can be applied.
This man showed that Lie groups could be approximated by finite groups and independently proved the central limit theorem using the Gaussian error function.
Alan Turing