Difference between revisions of "Alpha-conversion"
Jump to navigation
Jump to search
| Line 3: | Line 3: | ||
=Godel Numbering= | =Godel Numbering= | ||
Think about variables in terms of special numbers. This is an insight from Godel<ref name="Scott Part 2">{{:Video/Dana Scott - Theory and Models of Lambda Calculus Untyped and Typed - Part 2 of 5 - λC 2017}}</ref><ref extends="Scott Part 2">[https://youtu.be/S1aoZb7vF4M?t=2880 Scott said:"With a little bit of set theory and arithmetic, this can be taught to juniors."] </ref>, and later utilized to created [[Universal computation]]. | Think about variables in terms of special numbers. This is an insight from Godel<ref name="Scott Part 2">{{:Video/Dana Scott - Theory and Models of Lambda Calculus Untyped and Typed - Part 2 of 5 - λC 2017}}</ref><ref extends="Scott Part 2">[https://youtu.be/S1aoZb7vF4M?t=2880 Scott said:"With a little bit of set theory and arithmetic, this can be taught to juniors."] </ref>, and later utilized to created [[Universal computation]]. | ||
=We don't need Turing Machine= | |||
In this lecture<ref>[https://youtu.be/S1aoZb7vF4M?t=3100 Scott:"We don't need Turing Machine."]</ref>, Scott explicitly stated that: | |||
"We don't need Turing Machine, I hope I can convince you of that." | |||
<noinclude> | <noinclude> | ||
Revision as of 02:29, 19 January 2022
conversion is also a kind of naming abstraction.
Godel Numbering
Think about variables in terms of special numbers. This is an insight from Godel[1]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 lecture[2], Scott explicitly stated that:
"We don't need Turing Machine, I hope I can convince you of that."