Hyperoperation (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hyperoperation" in English language version.

refsWebsite

Global rank English rank

15doi.org

2^nd place

8semanticscholar.org

11^th place

8^th place

4web.archive.org

1^st place

3jstor.org

26^th place

20^th place

2mrob.com

low place

2eretrandre.org

low place

1tetration.org

low place

1unibe.ch

2,608^th place

3,516^th place

1psu.edu

207^th place

136^th place

1nist.gov

355^th place

454^th place

1mpmueller.net

low place

1andydude.github.io

low place

1ingalidakis.com

low place

1wolframscience.com

low place

1chalkdustmagazine.com

low place

1utexas.edu

916^th place

706^th place

1sciencemag.org

857^th place

3,832^nd place

1harvard.edu

18^th place

17^th place

1nih.gov

4^th place

1acm.org

1,185^th place

840^th place

1ethz.ch

2,224^th place

1,900^th place

1figshare.com

5,893^rd place

3,320^th place

acm.org

portal.acm.org

Holmes 1997. Holmes, W. N. (March 1997). "Composite Arithmetic: Proposal for a New Standard". Computer. 30 (3): 65–73. doi:10.1109/2.573666. Retrieved 21 April 2009.

andydude.github.io

Robbins 2005. Robbins, A. J. (November 2005). "Home of Tetration". Archived from the original on 13 June 2015. Retrieved 17 April 2009.

chalkdustmagazine.com

Townsend 2016. Townsend, Adam (12 May 2016). "Names for large numbers". Chalkdust magazine.

doi.org

Friedman 2001. Friedman, Harvey M. (July 2001). "Long Finite Sequences". Journal of Combinatorial Theory. Series A. 95 (1): 102–144. doi:10.1006/jcta.2000.3154.
Campagnola, Moore & Félix Costa 2002. Campagnola, Manuel Lameiras; Moore, Cristopher; Félix Costa, José (December 2002). "Transfinite Ordinals in Recursive Number Theory". Journal of Complexity. 18 (4): 977–1000. doi:10.1006/jcom.2002.0655.
Goodstein 1947. Goodstein, Reuben Louis (December 1947). "Transfinite Ordinals in Recursive Number Theory" (PDF). Journal of Symbolic Logic. 12 (4): 123–129. doi:10.2307/2266486. JSTOR 2266486. S2CID 1318943.
Bennett 1915. Bennett, Albert A. (December 1915). "Note on an Operation of the Third Grade". Annals of Mathematics. Second Series. 17 (2): 74–75. doi:10.2307/2007124. JSTOR 2007124.
Littlewood 1948. Littlewood, J. E. (July 1948). "Large Numbers". Mathematical Gazette. 32 (300): 163–171. doi:10.2307/3609933. JSTOR 3609933. S2CID 250442130.
The maximum depth of recursion refers to the number of levels of activation of a procedure which exist during the deepest call of the procedure. Cornelius & Kirby (1975) Cornelius, B.J.; Kirby, G.H. (1975). "Depth of recursion and the ackermann function". BIT Numerical Mathematics. 15 (2): 144–150. doi:10.1007/BF01932687. S2CID 120532578.
Knuth 1976. Knuth, Donald Ervin (December 1976). "Mathematics and Computer Science: Coping with Finiteness". Science. 194 (4271): 1235–1242. Bibcode:1976Sci...194.1235K. doi:10.1126/science.194.4271.1235. PMID 17797067. S2CID 1690489. Retrieved 21 April 2009.
Hilbert 1926. Hilbert, David (1926). "Über das Unendliche". Mathematische Annalen. 95: 161–190. doi:10.1007/BF01206605. S2CID 121888793.
Nambiar 1995. Nambiar, K. K. (1995). "Ackermann Functions and Transfinite Ordinals". Applied Mathematics Letters. 8 (6): 51–53. doi:10.1016/0893-9659(95)00084-4.
Doner & Tarski 1969. Doner, John; Tarski, Alfred (1969). "An extended arithmetic of ordinal numbers". Fundamenta Mathematicae. 65: 95–127. doi:10.4064/fm-65-1-95-127.
Clenshaw & Olver 1984. Clenshaw, C.W.; Olver, F.W.J. (April 1984). "Beyond floating point". Journal of the ACM. 31 (2): 319–328. doi:10.1145/62.322429. S2CID 5132225.
Holmes 1997. Holmes, W. N. (March 1997). "Composite Arithmetic: Proposal for a New Standard". Computer. 30 (3): 65–73. doi:10.1109/2.573666. Retrieved 21 April 2009.
Pinkiewicz, Holmes & Jamil 2000. Pinkiewicz, T.; Holmes, N.; Jamil, T. (2000). "Design of a composite arithmetic unit for rational numbers". Proceedings of the IEEE Southeast Con 2000. 'Preparing for the New Millennium' (Cat. No.00CH37105). Proceedings of the IEEE. pp. 245–252. doi:10.1109/SECON.2000.845571. ISBN 0-7803-6312-4. S2CID 7738926.
Doner & Tarski 1969, Definition 1. Doner, John; Tarski, Alfred (1969). "An extended arithmetic of ordinal numbers". Fundamenta Mathematicae. 65: 95–127. doi:10.4064/fm-65-1-95-127.
Doner & Tarski 1969, Theorem 3(iii). Doner, John; Tarski, Alfred (1969). "An extended arithmetic of ordinal numbers". Fundamenta Mathematicae. 65: 95–127. doi:10.4064/fm-65-1-95-127.

eretrandre.org

Goodstein 1947. Goodstein, Reuben Louis (December 1947). "Transfinite Ordinals in Recursive Number Theory" (PDF). Journal of Symbolic Logic. 12 (4): 123–129. doi:10.2307/2266486. JSTOR 2266486. S2CID 1318943.

math.eretrandre.org

Romerio 2008. Romerio, G. F. (21 January 2008). "Hyperoperations Terminology". Tetration Forum. Retrieved 21 April 2009.

ethz.ch

iis.ee.ethz.ch

Zimmermann 1997. Zimmermann, R. (1997). "Computer Arithmetic: Principles, Architectures, and VLSI Design" (PDF). Lecture notes, Integrated Systems Laboratory, ETH Zürich. Archived from the original (PDF) on 17 August 2013. Retrieved 17 April 2009.

figshare.com

Pinkiewicz, Holmes & Jamil 2000. Pinkiewicz, T.; Holmes, N.; Jamil, T. (2000). "Design of a composite arithmetic unit for rational numbers". Proceedings of the IEEE Southeast Con 2000. 'Preparing for the New Millennium' (Cat. No.00CH37105). Proceedings of the IEEE. pp. 245–252. doi:10.1109/SECON.2000.845571. ISBN 0-7803-6312-4. S2CID 7738926.

harvard.edu

ui.adsabs.harvard.edu

Knuth 1976. Knuth, Donald Ervin (December 1976). "Mathematics and Computer Science: Coping with Finiteness". Science. 194 (4271): 1235–1242. Bibcode:1976Sci...194.1235K. doi:10.1126/science.194.4271.1235. PMID 17797067. S2CID 1690489. Retrieved 21 April 2009.

ingalidakis.com

Galidakis 2003. Galidakis, I. N. (2003). "Mathematics". Archived from the original on 20 April 2009. Retrieved 17 April 2009.

jstor.org

Goodstein 1947. Goodstein, Reuben Louis (December 1947). "Transfinite Ordinals in Recursive Number Theory" (PDF). Journal of Symbolic Logic. 12 (4): 123–129. doi:10.2307/2266486. JSTOR 2266486. S2CID 1318943.
Bennett 1915. Bennett, Albert A. (December 1915). "Note on an Operation of the Third Grade". Annals of Mathematics. Second Series. 17 (2): 74–75. doi:10.2307/2007124. JSTOR 2007124.
Littlewood 1948. Littlewood, J. E. (July 1948). "Large Numbers". Mathematical Gazette. 32 (300): 163–171. doi:10.2307/3609933. JSTOR 3609933. S2CID 250442130.

mpmueller.net

Müller 1993. Müller, Markus (1993). "Reihenalgebra" (PDF). Archived from the original (PDF) on 2 December 2013. Retrieved 6 November 2021.

mrob.com

Munafo 1999a. Munafo, Robert (1999a). "Versions of Ackermann's Function". Large Numbers at MROB. Retrieved 28 August 2021.
Munafo 1999b. Munafo, Robert (1999b). "Inventing New Operators and Functions". Large Numbers at MROB. Retrieved 28 August 2021.

nih.gov

pubmed.ncbi.nlm.nih.gov

Knuth 1976. Knuth, Donald Ervin (December 1976). "Mathematics and Computer Science: Coping with Finiteness". Science. 194 (4271): 1235–1242. Bibcode:1976Sci...194.1235K. doi:10.1126/science.194.4271.1235. PMID 17797067. S2CID 1690489. Retrieved 21 April 2009.

nist.gov

xlinux.nist.gov

Black 2009. Black, Paul E. (16 March 2009). "Ackermann's function". Dictionary of Algorithms and Data Structures. U.S. National Institute of Standards and Technology (NIST). Retrieved 29 August 2021.

psu.edu

citeseerx.ist.psu.edu

Wirz 1999. Wirz, Marc (1999). "Characterizing the Grzegorczyk hierarchy by safe recursion" (PDF). Bern: Institut für Informatik und angewandte Mathematik. CiteSeerX 10.1.1.42.3374. S2CID 117417812.

sciencemag.org

Knuth 1976. Knuth, Donald Ervin (December 1976). "Mathematics and Computer Science: Coping with Finiteness". Science. 194 (4271): 1235–1242. Bibcode:1976Sci...194.1235K. doi:10.1126/science.194.4271.1235. PMID 17797067. S2CID 1690489. Retrieved 21 April 2009.

semanticscholar.org

api.semanticscholar.org

Wirz 1999. Wirz, Marc (1999). "Characterizing the Grzegorczyk hierarchy by safe recursion" (PDF). Bern: Institut für Informatik und angewandte Mathematik. CiteSeerX 10.1.1.42.3374. S2CID 117417812.
Goodstein 1947. Goodstein, Reuben Louis (December 1947). "Transfinite Ordinals in Recursive Number Theory" (PDF). Journal of Symbolic Logic. 12 (4): 123–129. doi:10.2307/2266486. JSTOR 2266486. S2CID 1318943.
Littlewood 1948. Littlewood, J. E. (July 1948). "Large Numbers". Mathematical Gazette. 32 (300): 163–171. doi:10.2307/3609933. JSTOR 3609933. S2CID 250442130.
The maximum depth of recursion refers to the number of levels of activation of a procedure which exist during the deepest call of the procedure. Cornelius & Kirby (1975) Cornelius, B.J.; Kirby, G.H. (1975). "Depth of recursion and the ackermann function". BIT Numerical Mathematics. 15 (2): 144–150. doi:10.1007/BF01932687. S2CID 120532578.
Knuth 1976. Knuth, Donald Ervin (December 1976). "Mathematics and Computer Science: Coping with Finiteness". Science. 194 (4271): 1235–1242. Bibcode:1976Sci...194.1235K. doi:10.1126/science.194.4271.1235. PMID 17797067. S2CID 1690489. Retrieved 21 April 2009.
Hilbert 1926. Hilbert, David (1926). "Über das Unendliche". Mathematische Annalen. 95: 161–190. doi:10.1007/BF01206605. S2CID 121888793.
Clenshaw & Olver 1984. Clenshaw, C.W.; Olver, F.W.J. (April 1984). "Beyond floating point". Journal of the ACM. 31 (2): 319–328. doi:10.1145/62.322429. S2CID 5132225.
Pinkiewicz, Holmes & Jamil 2000. Pinkiewicz, T.; Holmes, N.; Jamil, T. (2000). "Design of a composite arithmetic unit for rational numbers". Proceedings of the IEEE Southeast Con 2000. 'Preparing for the New Millennium' (Cat. No.00CH37105). Proceedings of the IEEE. pp. 245–252. doi:10.1109/SECON.2000.845571. ISBN 0-7803-6312-4. S2CID 7738926.

tetration.org

Geisler 2003. Geisler, Daniel (2003). "What lies beyond exponentiation?". Retrieved 17 April 2009.

unibe.ch

home.inf.unibe.ch

Wirz 1999. Wirz, Marc (1999). "Characterizing the Grzegorczyk hierarchy by safe recursion" (PDF). Bern: Institut für Informatik und angewandte Mathematik. CiteSeerX 10.1.1.42.3374. S2CID 117417812.

utexas.edu

cs.utexas.edu

Cowles & Bailey 1988. Cowles, J.; Bailey, T. (30 September 1988). "Several Versions of Ackermann's Function". Dept. of Computer Science, University of Wyoming, Laramie, WY. Retrieved 29 August 2021.

web.archive.org

Müller 1993. Müller, Markus (1993). "Reihenalgebra" (PDF). Archived from the original (PDF) on 2 December 2013. Retrieved 6 November 2021.
Robbins 2005. Robbins, A. J. (November 2005). "Home of Tetration". Archived from the original on 13 June 2015. Retrieved 17 April 2009.
Galidakis 2003. Galidakis, I. N. (2003). "Mathematics". Archived from the original on 20 April 2009. Retrieved 17 April 2009.
Zimmermann 1997. Zimmermann, R. (1997). "Computer Arithmetic: Principles, Architectures, and VLSI Design" (PDF). Lecture notes, Integrated Systems Laboratory, ETH Zürich. Archived from the original (PDF) on 17 August 2013. Retrieved 17 April 2009.

wolframscience.com

forum.wolframscience.com

Rubtsov & Romerio 2005. Rubtsov, C. A.; Romerio, G. F. (December 2005). "Ackermann's Function and New Arithmetical Operation". Retrieved 17 April 2009.