Difference between revisions of "Alpha-conversion"
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
=We don't need Turing Machine= | =We don't need Turing Machine= | ||
In this lecture<ref extends="Scott Part 2">[https://youtu.be/S1aoZb7vF4M?t= | In this lecture<ref extends="Scott Part 2">[https://youtu.be/S1aoZb7vF4M?t=3196 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." | "We don't need Turing Machine, I hope I can convince you of that." | ||
<noinclude> | <noinclude> | ||
Revision as of 02:30, 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 lectureCite error: Invalid <ref> tag; invalid names, e.g. too many, Scott explicitly stated that:
"We don't need Turing Machine, I hope I can convince you of that."
References
- ↑ Scott, Dana (Oct 12, 2017). Dana Scott - Theory and Models of Lambda Calculus Untyped and Typed - Part 2 of 5 - λC 2017. local page: LambdaConf.