A Log-Sensitive Encoding of Turing Machines in the λ-Calculus

01/29/2023
by   Beniamino Accattoli, et al.
0

This note modifies the reference encoding of Turing machines in the λ-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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/28/2017

Encoding Turing Machines into the Deterministic Lambda-Calculus

This note is about encoding Turing machines into the lambda-calculus....
research
01/22/2021

Exploring Rulial Space: The Case of Turing Machines

As an example of the concept of rulial space, we explore the case of sim...
research
07/01/2021

Addressing Machines as models of lambda-calculus

Turing machines and register machines have been used for decades in theo...
research
02/03/2019

Some Remarks on Real-Time Turing Machines

The power of real-time Turing machines using sublinear space is investig...
research
04/29/2021

Turing Completeness and Sid Meier's Civilization

We prove that three strategy video games from the Sid Meier's Civilizati...
research
03/07/2020

Quantum Random Access Stored-Program Machines

Random access machines (RAMs) and random access stored-program machines ...
research
11/11/1999

What Next? A Dozen Information-Technology Research Goals

Charles Babbage's vision of computing has largely been realized. We are ...

Please sign up or login with your details

Forgot password? Click here to reset