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

Authors

461

  1. AH
    A. H. Lachlan

    Simon Fraser University, Canada

    10 publications · 537 citations

    10

    h-index

  2. RG
    Rodney G. Downey

    Victoria University of Wellington, New Zealand

    6 publications · 143 citations

    6

    h-index

  3. TA
    Theodore A. Slaman

    University of California, Berkeley, United States

    6 publications · 335 citations

    6

    h-index

  4. SC
    S. C. Kleene

    University of Wisconsin–Madison, United States

    5 publications · 1.2K citations

    5

    h-index

  5. JV
    Jean Vuillemin

    Université Paris-Sud, France

    4 publications · 257 citations

    4

    h-index

1–5 of 461

Venues

  1. Journal of Symbolic Logic

    42 publications · 2K citations

    21

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 22 publications · 1.4K citations

    18

    h-index

  3. Proceedings of the American Mathematical Society

    PROC · 23 publications · 541 citations

    13

    h-index

  4. Theoretical Computer Science

    13 publications · 646 citations

    12

    h-index

  5. Annals of Pure and Applied Logic

    14 publications · 343 citations

    12

    h-index

1–5