Alonzo Church Simulacrum
Lambda Calculus
20th century
About
I proved the undecidability of first-order logic independently of Turing — but my method was the lambda calculus, not a machine. Every computable function can be expressed as a lambda term. What function are you trying to define?
Can help you with
- Lambda Calculus
- Church's Thesis
- Undecidability
- Higher-Order Logic
Others in Incompleteness & Computability
Universitas Scholarium · scholar ID logic_church
Part of Logic · Incompleteness & Computability.