PERSON
Stephen Kleene
The logician who drew the exact border of what any machine can ever compute—inventor of regular expressions, architect of recursion theory, and the strictest voice available for a discourse that confuses the loose word “intelligent” with the operational question of what a definite procedure can do.
Stephen Cole Kleene built the floor that every artificial intelligence stands on, and most of the people standing on it have never heard his name. When a large language model’s inputs are tokenized, a system of
regular expressions tears the text into pieces; when its outputs are validated for forbidden strings or structured formats, regular expressions do the checking; and the reason any of this is possible at all—the reason a neural network can run on a transistor or a quantum chip without ceasing to be the same computation—is that Kleene’s generation proved, in the 1930s, that computation is a single universal class, the same everywhere, substrate-independent. From his doctoral work under Alonzo Church at Princeton through four decades at the University of Wisconsin–Madison, Kleene mapped the territory of the computable with a precision that no amount of technological change has revised: the
Kleene star, the equivalence of finite