Recursive Functions

Recursive Functions is a class of number-theoretic functions that are computable by a finite mechanical procedure and defined inductively through the operations of composition, primitive recursion, and minimization, distinguishing them as the mathematical formalization of effectively calculable functions in computability theory.

1.1K

Publications

69.7K

Citations

1.3K

Authors

601

Institutions

Publications per year

2017–2026

54

Variants

General Recursive Functionsμ-Recursive Functions

Authors

1.3K

  1. SC
    S. C. Kleene

    University of Wisconsin–Madison, United States

    10 publications · 1.5K citations

    10

    h-index

  2. JM
    John Myhill

    University at Buffalo, State University of New York, United States

    8 publications · 427 citations

    8

    h-index

  3. ZM
    Zohar Manna

    Stanford University, United States

    8 publications · 580 citations

    8

    h-index

  4. AW
    Andreas Weiermann

    University of Münster, Germany

    8 publications · 148 citations

    8

    h-index

  5. GL
    G. Ladas

    University of Rhode Island, United States

    7 publications · 739 citations

    7

    h-index

1–5 of 1.3K

Venues

  1. Journal of Symbolic Logic

    114 publications · 5.3K citations

    35

    h-index

  2. Theoretical Computer Science

    45 publications · 1.9K citations

    23

    h-index

  3. Transactions of the American Mathematical Society

    TRAN · 30 publications · 3.5K citations

    22

    h-index

  4. Mathematical logic quarterly

    MLQ · 25 publications · 695 citations

    16

    h-index

  5. SIAM Journal on Computing

    15 publications · 2K citations

    15

    h-index

1–5