This man proved that the halting problem is not generally solvable except in cases of fewer than four states, and Tibor Rado developed a type of an object named for him that finds the most work one can do, the busy beaver.
This man proved that the halting problem is not generally solvable except in cases of fewer than four states, and Tibor Rado developed a type of an object named for him that finds the most work one can do, the busy beaver. This man names a thesis about the equivalence of the lambda calculus and another system along with Church. For 10 points, name this British computer scientist who helped break the Enigma cipher and whose namesake test is a benchmark for artificial intelligence and whose namesake machines are abstracted computers.
This man proved that the halting problem is not generally solvable except in cases of fewer than four states, and Tibor Rado developed a type of an object named for him that finds the most work one can do, the busy beaver.
Alan {Turing}