This man's namesake algebra is a generalized boolean algebra that consists of a bounded distributive lattice with an involution, and his name is sometimes given to the hierarchy of sets that is based on the complexity of operations that define them. Another result named for him states that for any recursive operator there exists a partial computable function such that the function of the operator returns the operator, known as his namesake recurs
This man's namesake algebra is a generalized boolean algebra that consists of a bounded distributive lattice with an involution, and his name is sometimes given to the hierarchy of sets that is based on the complexity of operations that define them. Another result named for him states that for any recursive operator there exists a partial computable function such that the function of the operator returns the operator, known as his namesake recursion theorem. A function that combines with and negates itself is the subject of another statement of this man, which shows that the original lambda calculus is inconsistent; that's a paradox named for him and Rosser. For 10 points, name this computer scientist who invented regular expressions, which use a namesake operation star to define all possible strings of a character set, known as his "star".
This man's namesake algebra is a generalized boolean algebra that consists of a bounded distributive lattice with an involution, and his name is sometimes given to the hierarchy of sets that is based on the complexity of operations that define them.
Stephen Cole {Kleene}