Fixed Point Theorems in Computability Theory
Logic
2024-02-06 v1 Logic in Computer Science
Abstract
We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to these.
Keywords
Cite
@article{arxiv.2402.03069,
title = {Fixed Point Theorems in Computability Theory},
author = {Sebastiaan A. Terwijn},
journal= {arXiv preprint arXiv:2402.03069},
year = {2024}
}