Fixed-point Theorems In Computability
Fixed-Point Theorems in Computability is a theoretical framework within computability theory that establishes the existence of recursive functions or programs that are semantically equivalent to their own computational descriptions, thereby enabling self-referential constructions in formal systems.
23
Publications
747
Citations
30
Authors
27
Institutions
Publications per year
2017–2026
4
Parents
23
The Computability Problem in Algebraic Topology
Francis Sergeraert · Advances in Mathematics · 1994 · 99 citations
Real Number Computability and Domain Theory
Pietro Di Gianantonio · Information and Computation · 1996 · 52 citations
1–5 of 23
30
2 publications · 26 citations
2
h-index
2
h-index
1
h-index
1
h-index
1 publications · 13 citations
1
h-index
1–5 of 30
27
Kyoto Sangyo University
Kyoto, Japan
2 h-index
4 publications
208 citations

Federal University of São João del-Rei
São João del Rei, Brazil
1 h-index
1 publications
37 citations

The Graduate Center, CUNY
New York, United States
1 h-index
1 publications
87 citations
Queen Mary University of London
London, United Kingdom
1 h-index
1 publications
42 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
1 publications
61 citations
Institut Alfred Fournier
Paris, France
1 h-index
1 publications
99 citations

Naval Information Warfare Center Pacific
San Diego, United States
1 h-index
1 publications
14 citations
University of Udine
Udine, Italy
1 h-index
1 publications
52 citations
1–8 of 27
2 publications · 80 citations
2
h-index
2 publications · 26 citations
2
h-index
2 publications · 136 citations
2
h-index
2 publications · 26 citations
2
h-index
CRO · 1 publications · 23 citations
1
h-index
1–5