Symmetry for transfinite computability
Logic
2023-02-14 v1
Abstract
Finite Turing computation has a fundamental symmetry between inputs, outputs, programs, time, and storage space. Standard models of transfinite computational break this symmetry; we consider ways to recover it and study the resulting model of computation. This model exhibits the same symmetry as finite Turing computation in universes constructible from a set of ordinals, but that statement is independent of von Neumann-G\"odel-Bernays class theory.
Cite
@article{arxiv.2302.06444,
title = {Symmetry for transfinite computability},
author = {Lorenzo Galeotti and Ethan S. Lewis and Benedikt Löwe},
journal= {arXiv preprint arXiv:2302.06444},
year = {2023}
}