Beginner
Compilers & Programming Language Theory
Q37 / 100
What is the lambda calculus?
Correct! Well done.
Incorrect.
The correct answer is B) A formal system for computation based on anonymous function abstraction (λx.e) and application, equivalent in power to Turing machines
B
Correct Answer
A formal system for computation based on anonymous function abstraction (λx.e) and application, equivalent in power to Turing machines
Explanation
Lambda calculus (Church 1932): λx.x is the identity function. Application: (λx.x+1) 5 = 6. β-reduction: (λx.e₁) e₂ → e₁[x:=e₂]. Church-Turing thesis: LC and TMs compute the same functions. Foundation of functional programming.
Progress
37/100