When one object named for this scientist features a set of rules calling for only one action in any given situation, then it is called deterministic.
This man showed that it is not possible to determine whether a finite input and program will eventually terminate. When one object named for this scientist features a set of rules calling for only one action in any given situation, then it is called deterministic. In addition to working with a halting problem, this man names a (*) thesis along with the developer of lambda calculus, about the existence of a namesake machine for every algorithm. For 10 points, name this man that names a thesis along with Alonzo Church, whose namesake machine consists of an infinite tape and is often used to simulate computer algorithms.
This man showed that it is not possible to determine whether a finite input and program will eventually terminate.
Alan {Turing}