For 10 points, name this British computer scientist whose namesake test determines whether or not computers can behave like humans.
This man developed a technique for factorizing a square matrix into a product of upper and lower triangular matrices, and this man proved the central limit theorem independently by using the Gaussian error function. This man proved that no algorithm could determine whether or not a program would run forever or stop, finding that the halting problem is undecidable. A hypothesis named for Church and this man states that no possible computing device can be more powerful than his namesake machine. For 10 points, name this British computer scientist whose namesake test determines whether or not computers can behave like humans.
This man developed a technique for factorizing a square matrix into a product of upper and lower triangular matrices, and this man proved the central limit theorem independently by using the Gaussian error function.
Alan Turing