DeepAI AI Chat
Log In Sign Up

Encoding Turing Machines into the Deterministic Lambda-Calculus

11/28/2017
by   Ugo Dal Lago, et al.
0

This note is about encoding Turing machines into the lambda-calculus.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/29/2023

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

This note modifies the reference encoding of Turing machines in the λ-ca...
07/01/2021

Addressing Machines as models of lambda-calculus

Turing machines and register machines have been used for decades in theo...
10/12/2021

Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine

The diagonalization technique was invented by Georg Cantor to show that ...
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...
08/31/2022

Python Type Hints are Turing Complete

Grigore showed that Java generics are Turing complete by describing a re...
06/30/2021

On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus

In the paper we define three new complexity classes for Turing Machine u...
10/21/2019

A Note on a Unifying Proof of the Undecidability of Several Diagrammatic Properties of Term Rewriting Systems

In this note we give a simple unifying proof of the undecidability of se...