Along with one co-developer of lambda calculus, this man names a statement based on Hilbert's En·tschei·dungs·problem, which relates calculable and computable functions.
Along with one co-developer of lambda calculus, this man names a statement based on Hilbert's En·tschei·dungs·problem, which relates calculable and computable functions. One of his proposals was challenged by John Searle, who said that programs like Weizenbaum's ELIZA are akin to a non-Chinese speaker using a dictionary. He developed the bombe to solve the Enigma cipher. A busy beaver is an example of a hypothetical device named for him, consisting of an infinitely long tape and a head which can read and write to the tape, his namesake machine. For 10 points, name this British computer scientist whose namesake test evaluates a machine's ability to appear intelligent.
Along with one co-developer of lambda calculus, this man names a statement based on Hilbert's En·tschei·dungs·problem, which relates calculable and computable functions.
Alan Mathison {Turing}