Fixed Point Theorems in Computability Theory
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917582432370688 |
|---|---|
| author | Terwijn, Sebastiaan A. |
| author_facet | Terwijn, Sebastiaan A. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_03069 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fixed Point Theorems in Computability Theory Terwijn, Sebastiaan A. Logic Logic in Computer Science 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. |
| title | Fixed Point Theorems in Computability Theory |
| topic | Logic Logic in Computer Science |
| url | https://arxiv.org/abs/2402.03069 |