A Log-Sensitive Encoding of Turing Machines in the $\lambda$-Calculus
Abstract
This note modifies the reference encoding of Turing machines in the $\lambda$-calculus by Dal Lago and Accattoli, which is tuned for time efficiency, as to accommodate logarithmic space. There are two main changes: Turing machines now have *two* tapes, an input tape and a work tape, and the input tape is encoded differently, because the reference encoding comes with a linear space overhead for managing tapes, which is excessive for studying logarithmic space.
- Publication:
-
arXiv e-prints
- Pub Date:
- January 2023
- DOI:
- 10.48550/arXiv.2301.12556
- arXiv:
- arXiv:2301.12556
- Bibcode:
- 2023arXiv230112556A
- Keywords:
-
- Computer Science - Logic in Computer Science;
- Computer Science - Programming Languages
- E-Print:
- arXiv admin note: substantial text overlap with arXiv:2203.00362