General recursive function (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "General recursive function" in English language version.

Last modified: 17:51:19, 2 March 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

33doi.org

2^nd place

22stanford.edu

194^th place

182^nd place

11projecteuclid.org

4,781^st place

3,117^th place

11jstor.org

23^rd place

15^th place

11semanticscholar.org

15^th place

8^th place

11ams.org

434^th place

249^th place

ams.org (Global: 434^th place; English: 249^th place)

Stephen Cole Kleene (Jan 1943). "Recursive predicates and quantifiers" (PDF). Transactions of the American Mathematical Society. 53 (1): 41–73. doi:10.1090/S0002-9947-1943-0007371-8.

doi.org (Global: 2^nd place; English: 2^nd place)

Kleene, Stephen C. (1936). "λ-definability and recursiveness". Duke Mathematical Journal. 2 (2): 340–352. doi:10.1215/s0012-7094-36-00227-2.
Turing, Alan Mathison (Dec 1937). "Computability and λ-Definability". Journal of Symbolic Logic. 2 (4): 153–163. doi:10.2307/2268280. JSTOR 2268280. S2CID 2317046. Proof outline on p.153: $\lambda {\mbox{-definable}}$ ${\stackrel {triv}{\implies }}$ $\lambda {\mbox{-}}K{\mbox{-definable}}$ ${\stackrel {160}{\implies }}$ ${\mbox{Turing computable}}$ ${\stackrel {161}{\implies }}$ $\mu {\mbox{-recursive}}$ ${\stackrel {Kleene}{\implies }}$ ^[3] $\lambda {\mbox{-definable}}$
Stephen Cole Kleene (Jan 1943). "Recursive predicates and quantifiers" (PDF). Transactions of the American Mathematical Society. 53 (1): 41–73. doi:10.1090/S0002-9947-1943-0007371-8.

jstor.org (Global: 23^rd place; English: 15^th place)

Turing, Alan Mathison (Dec 1937). "Computability and λ-Definability". Journal of Symbolic Logic. 2 (4): 153–163. doi:10.2307/2268280. JSTOR 2268280. S2CID 2317046. Proof outline on p.153: $\lambda {\mbox{-definable}}$ ${\stackrel {triv}{\implies }}$ $\lambda {\mbox{-}}K{\mbox{-definable}}$ ${\stackrel {160}{\implies }}$ ${\mbox{Turing computable}}$ ${\stackrel {161}{\implies }}$ $\mu {\mbox{-recursive}}$ ${\stackrel {Kleene}{\implies }}$ ^[3] $\lambda {\mbox{-definable}}$

projecteuclid.org (Global: 4,781^st place; English: 3,117^th place)

Kleene, Stephen C. (1936). "λ-definability and recursiveness". Duke Mathematical Journal. 2 (2): 340–352. doi:10.1215/s0012-7094-36-00227-2.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Turing, Alan Mathison (Dec 1937). "Computability and λ-Definability". Journal of Symbolic Logic. 2 (4): 153–163. doi:10.2307/2268280. JSTOR 2268280. S2CID 2317046. Proof outline on p.153: $\lambda {\mbox{-definable}}$ ${\stackrel {triv}{\implies }}$ $\lambda {\mbox{-}}K{\mbox{-definable}}$ ${\stackrel {160}{\implies }}$ ${\mbox{Turing computable}}$ ${\stackrel {161}{\implies }}$ $\mu {\mbox{-recursive}}$ ${\stackrel {Kleene}{\implies }}$ ^[3] $\lambda {\mbox{-definable}}$

stanford.edu (Global: 194^th place; English: 182^nd place)

plato.stanford.edu

"Recursive Functions". The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University. 2021.
Stanford Encyclopedia of Philosophy, Entry Recursive Functions, Sect.1.7: "[The class of μ-recursive functions] turns out to coincide with the class of the Turing-computable functions introduced by Alan Turing as well as with the class of the λ-definable functions introduced by Alonzo Church."

General recursive function (English Wikipedia)

ams.org (Global: 434th place; English: 249th place)

doi.org (Global: 2nd place; English: 2nd place)

jstor.org (Global: 23rd place; English: 15th place)

projecteuclid.org (Global: 4,781st place; English: 3,117th place)

semanticscholar.org (Global: 15th place; English: 8th place)