DeepAI AI Chat

Encoding Turing Machines into the Deterministic Lambda-Calculus

11/28/2017

∙

by Ugo Dal Lago, et al.

∙

∙

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

Ugo Dal Lago
34 publications
Beniamino Accattoli
25 publications

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...

0 Beniamino Accattoli, et al. ∙

∙ 07/01/2021

Addressing Machines as models of lambda-calculus

Turing machines and register machines have been used for decades in theo...

0 Giuseppe Della Penna, et al. ∙

∙ 10/12/2021

Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine

The diagonalization technique was invented by Georg Cantor to show that ...

0 Tianrong Lin, et al. ∙

∙ 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...

0 Stephen Wolfram, et al. ∙

∙ 08/31/2022

Python Type Hints are Turing Complete

Grigore showed that Java generics are Turing complete by describing a re...

0 Ori Roth, et al. ∙

∙ 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...

0 Eugene Eberbach, et al. ∙

∙ 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...

0 António Malheiro, et al. ∙