Alonzo Church
(5 articles)
Lambda Calculus
A formal system in mathematical logic and computer science for expressing computation based on function abstraction and application.
Generality: 500
Decidability
Whether a problem can be algorithmically solved, meaning there exists a clear procedure (algorithm) that will determine a yes-or-no answer for any given input within a finite amount of time.
Generality: 861
Turing Completeness
Systems that can simulate a Turing machine's computational abilities.
Generality: 890
Church-Turing Thesis
A hypothesis proposing that any computational problem solvable by a human using algorithms can also be solved by a Turing machine, which forms a foundation for the theoretical limits of computation.
Generality: 500
Church Encoding
A technique in mathematical logic and computer science to represent data and operators in the lambda calculus.
Generality: 500