Python Type Hints are Turing Complete

08/31/2022
by   Ori Roth, et al.
0

Grigore showed that Java generics are Turing complete by describing a reduction from Turing machines to Java subtyping. We apply Grigore's algorithm to Python type hints and deduce that they are Turing complete. In addition, we present an alternative reduction in which the Turing machines are simulated in real time, resulting in significantly lower compilation times. Our work is accompanied by a Python implementation of both reductions that compiles Turing machines into Python subtyping machines.

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
08/28/2023

A conservative Turing complete S^4 flow

We present a Turing complete, volume preserving, smooth flow on the 4-sp...
research
02/03/2019

Some Remarks on Real-Time Turing Machines

The power of real-time Turing machines using sublinear space is investig...
research
01/27/2023

Turing Machines Equipped with CTC in Physical Universes

We study the paradoxical aspects of closed time-like curves and their im...
research
01/30/2019

Neuroevolution with Perceptron Turing Machines

We introduce the perceptron Turing machine and show how it can be used t...
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
08/30/2019

How Relevant is the Turing Test in the Age of Sophisbots?

Popular culture has contemplated societies of thinking machines for gene...

Please sign up or login with your details

Forgot password? Click here to reset