Dana Scott on Lambda Calculus

From PKC
Revision as of 03:45, 20 January 2022 by Benkoo (talk | contribs) (→‎Lecture 3)
Jump to navigation Jump to search

Prof. Dana Scott gave a few talks on Lambda Calculus, and some of them are available on Youtube.

A list of them can be found here:

Local Links

This video series seems to be taken in the same day, a total of 5 hours. Prof. Scott offered many anecdotal insights on how calculus was invented and formed. It directly relates to the notion of function and combinators. Particularly, the SK Combinators.

Lecture 1

This starting lecture talks about the name of Lambda came from[1].

Lecture 2

Godel Numbering

Think about variables in terms of special numbers. This is an insight from Godel[2]Cite error: Invalid <ref> tag; invalid names, e.g. too many, and later utilized to created Universal computation.

We don't need Turing Machine

In this lectureCite error: Invalid <ref> tag; invalid names, e.g. too many, Scott explicitly stated that:

"You don't need Turing Machine to understand it, I hope I can convince you of that."

Scott's Universe is the Powerset of Integers

In this lectureCite error: Invalid <ref> tag; invalid names, e.g. too many, Scott explicitly stated that:

"The Universe if the Powerset of Integers."

Sophomores or Juniors should learn some Topology

Sophomores or juniors should have some topology from calculus...

A neighborhood of a possibly infinite set...

Once you define Topology, you may define continuous functions

Lecture 3

This lecture[3] starts to mention the notion of algebraic closure and fixed points.

Lecture 4

This lecture[4] mentioned three important persons in logic.

  1. John Myhill
  2. John Sheperdson
  3. Hartley Rogers Jr.



References

Related Pages