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
1.1K
Theory of Recursive Functions and Effective Computability
D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text
1–5 of 1.1K
1.3K
10
h-index
University at Buffalo, State University of New York, United States
8 publications · 427 citations
8
h-index
8
h-index
8
h-index
7
h-index
1–5 of 1.3K
601
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
18 h-index
28 publications
1K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
25 publications
935 citations
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
26 publications
3.9K citations
Stanford University
Stanford, United States
14 h-index
21 publications
1.2K citations
Carnegie Mellon University
Pittsburgh, United States
14 h-index
31 publications
1.8K citations
University of California, Berkeley
Berkeley, United States
13 h-index
18 publications
1.6K citations

Cornell University
Ithaca, United States
12 h-index
17 publications
692 citations
University of Illinois Urbana-Champaign
Urbana, United States
11 h-index
14 publications
1.1K citations
1–8 of 601
114 publications · 5.3K citations
35
h-index
45 publications · 1.9K citations
23
h-index
TRAN · 30 publications · 3.5K citations
22
h-index
MLQ · 25 publications · 695 citations
16
h-index
15 publications · 2K citations
15
h-index
1–5