Recursion Theorem
The Recursion Theorem is a foundational result in recursion theory stating that for any computable function there exists a fixed point, enabling a program to obtain its own index, thereby allowing self-referential constructions within the formal framework of computable functions.
359
Publications
21.7K
Citations
461
Authors
264
Institutions
Publications per year
2017–2026
16
359
General recursive functions of natural numbers
S. C. Kleene · Mathematische Annalen · 1936 · 595 citations
1–5 of 359
461
10
h-index
6
h-index
6
h-index
5
h-index
4
h-index
1–5 of 461
264
University of Chicago
Chicago, United States
9 h-index
10 publications
479 citations
University of California, Berkeley
Berkeley, United States
9 h-index
9 publications
361 citations

Victoria University of Wellington
Wellington, New Zealand
8 h-index
12 publications
269 citations
University of Wisconsin–Madison
Madison, United States
8 h-index
12 publications
288 citations
Stanford University
Stanford, United States
7 h-index
14 publications
644 citations

Cornell University
Ithaca, United States
6 h-index
7 publications
278 citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
7 publications
220 citations
University of Maryland, College Park
College Park, United States
5 h-index
6 publications
145 citations
1–8 of 264
42 publications · 2K citations
21
h-index
TRAN · 22 publications · 1.4K citations
18
h-index
PROC · 23 publications · 541 citations
13
h-index
13 publications · 646 citations
12
h-index
14 publications · 343 citations
12
h-index
1–5