Lambda Calculus Flashcards

1
Q

What form of computation did Turing propose?

A

Imperative programming which both humans and computers were capable of calculating through a set of unambiguous instructions.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What was the Turing machine?

A

A finite tape that moves left and right based on whether a result is 1 or 0.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What form of computation did Church propose?

A

Functional encoding (lambda calculus).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the Turing-Church thesis?

A

The finding that both the Turing and Church computations give an equivalent output for the same input.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What are the 4 components of Lambda Calculus? Define each…

A

Constants - Types of variables such as Integer, Float etc.
Variables - The value that the variables hold.
Application - Applying the function to the arguments.
Function - The body of the function.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are the 3 conversion rules?

A

Alpha - Converting the name of a variable across the entire function.
Beta - Converting input to output.
Eta - If functions are equivalent, the arguments can be dropped.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly