Timeline for Lambda calculus without free variables is as strong as lambda calculus?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 31, 2020 at 4:53 | vote | accept | Борат Сагдиев | ||
| May 30, 2020 at 16:34 | comment | added | Andrej Bauer | The usual proofs of completeness show that every Turing machine can be simulated by a closed $\lambda$-term (i.e., no free variables). | |
| May 30, 2020 at 15:53 | answer | added | chi | timeline score: 2 | |
| May 29, 2020 at 18:46 | review | First posts | |||
| May 30, 2020 at 7:49 | |||||
| May 29, 2020 at 18:40 | history | asked | Борат Сагдиев | CC BY-SA 4.0 |