3 ms·
"...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 Tu
by belter 4y ago
"...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..."
[PDF] - https://arxiv.org/pdf/2208.14755.pdf https://arxiv.org/pdf/2208.14755.pdf
"OriRoth/python-typing-machines: Python Typing Machines 1.0" - https://zenodo.org/record/7004898 https://zenodo.org/record/7004898