05/01/2009, 08:17 PM

I made this timeline to put hyperopertions research in perspective, so let me know if I got anything wrong, or missed anything. I'll try to remember to add Maurer and Kneser in a later post. All of these are chronological.

1852

E. M. Lemeray writes Sur les fonctions iteratives er sur une nouvelle fonction (Association Francaise pour l'Avancement des Sciences, Congres Bordeaux 2) in which he calls tetration the "fourth natural algorithm" (according to Knoebel).

1898

H. Schubert writes Grundlagen der Arithmetik (Encyklopadie der Mathematischen Wissenschaften mit Einschluss ihrer Anwendungen) in which he discusses tetration, and calls this the "operation of the fourth kind" (according to Knoebel).

1915

A.A. Bennett writes Note on an Operation of the Third Grade (available here) where he mentions the idea of hyperoperations (specifically commutative hyperoperations).

1928

Wilhelm Ackermann writes Zum Hilbertschen Aufbau der reellen Zahlen (available here) in which he defined the hierarchy

While at first glance this looks identical to hyperoperations, it is in fact not.

As you can see, is different from pentation in a nontrivial way.

1935

Rozsa Peter writes one of these (not sure which one, got this from Robert Munafo here). This is where the modern Ackermann function was formed, and where the base was assumed to be 2 (which then made the Ackermann function a bivariate function). However, Robert Munafo says that Peter's initial conditions make the "zeration" equal , which would make this function produce very different values from the Ackermann function today.

1947

Reuben Louis Goodstein writes Transfinite Ordinals in Recursive Number Theory (available here) in which he defines the hierarchy . Apparently, this is the first time that addition was assigned . Together with the counting of exponents (as opposed to counting operators), this makes it equivalent to hyperoperations as we know them today. Goodstein also coins the terminology tetration, pentation, etc.

1948

Raphael M. Robinson writes Primitive recursive functions (available here) in which he references Peter's work. Robert Munafo says that it is here that the "zeration" becomes making the Ackermann function we know today. This means that the 2-argument Ackermann function would more correctly be called the Ackermann-Peter-Robinson function (which is quite a mouthful).

1976

Donald E. Knuth writes Coping with Finiteness (available here), in which he coins the up-arrow notation we use all the time.

1987

Nick Bromer writes Superexponentiation (available here), which is probably the source of the super-prefix (used for super-logarithm). He defines an arrow notation similar to Knuth's arrow, but offset by one such that and . Bromer references Knuth, so he was certainly aware of his notation, but apparently he dropped an arrow somewhere...

1993

Markus Müller writes Reigenalgebra (available here) in which he defines both up-arrow and down-arrow notations exactly like Bromer's, but offset from Knuth's arrow notation.

1994

K. K. Nambiar writes Ackermann functions and transfinite ordinals (available here) defines yet another notation for hyperoperations.

1999

Marc Wirz writes Characterizing the Grzegorczyk hierarchy by safe recursion (available here).

2000

Stephen R. Wassell writes Superexponentiation and Fixed Points of Exponential and Logarithmic Functions (available here) which continues Bromer's terminology.

Campagnolo and Moore and Costa write An analog characterization of the Grzegorczyk hierarchy (available here, later published in 2002) in which they consider various algorithmic complexity classes, which involve iterated exponentials. They use the notation (base e) and (base 2) for iterated exponentials. I believe this is the earliest reference to what has evolved into notation.

2001

Harvey M. Friedman writes Long Finite Sequences (available here)

Yunhi Cho and Kyunghwan Park write Inverse Functions of (available where?) uses MacDonnell's hyperpower terminology.

Andrew Robbins

1852

E. M. Lemeray writes Sur les fonctions iteratives er sur une nouvelle fonction (Association Francaise pour l'Avancement des Sciences, Congres Bordeaux 2) in which he calls tetration the "fourth natural algorithm" (according to Knoebel).

1898

H. Schubert writes Grundlagen der Arithmetik (Encyklopadie der Mathematischen Wissenschaften mit Einschluss ihrer Anwendungen) in which he discusses tetration, and calls this the "operation of the fourth kind" (according to Knoebel).

1915

A.A. Bennett writes Note on an Operation of the Third Grade (available here) where he mentions the idea of hyperoperations (specifically commutative hyperoperations).

1928

Wilhelm Ackermann writes Zum Hilbertschen Aufbau der reellen Zahlen (available here) in which he defined the hierarchy

While at first glance this looks identical to hyperoperations, it is in fact not.

As you can see, is different from pentation in a nontrivial way.

1935

Rozsa Peter writes one of these (not sure which one, got this from Robert Munafo here). This is where the modern Ackermann function was formed, and where the base was assumed to be 2 (which then made the Ackermann function a bivariate function). However, Robert Munafo says that Peter's initial conditions make the "zeration" equal , which would make this function produce very different values from the Ackermann function today.

1947

Reuben Louis Goodstein writes Transfinite Ordinals in Recursive Number Theory (available here) in which he defines the hierarchy . Apparently, this is the first time that addition was assigned . Together with the counting of exponents (as opposed to counting operators), this makes it equivalent to hyperoperations as we know them today. Goodstein also coins the terminology tetration, pentation, etc.

1948

Raphael M. Robinson writes Primitive recursive functions (available here) in which he references Peter's work. Robert Munafo says that it is here that the "zeration" becomes making the Ackermann function we know today. This means that the 2-argument Ackermann function would more correctly be called the Ackermann-Peter-Robinson function (which is quite a mouthful).

1976

Donald E. Knuth writes Coping with Finiteness (available here), in which he coins the up-arrow notation we use all the time.

1987

Nick Bromer writes Superexponentiation (available here), which is probably the source of the super-prefix (used for super-logarithm). He defines an arrow notation similar to Knuth's arrow, but offset by one such that and . Bromer references Knuth, so he was certainly aware of his notation, but apparently he dropped an arrow somewhere...

1993

Markus Müller writes Reigenalgebra (available here) in which he defines both up-arrow and down-arrow notations exactly like Bromer's, but offset from Knuth's arrow notation.

1994

K. K. Nambiar writes Ackermann functions and transfinite ordinals (available here) defines yet another notation for hyperoperations.

1999

Marc Wirz writes Characterizing the Grzegorczyk hierarchy by safe recursion (available here).

2000

Stephen R. Wassell writes Superexponentiation and Fixed Points of Exponential and Logarithmic Functions (available here) which continues Bromer's terminology.

Campagnolo and Moore and Costa write An analog characterization of the Grzegorczyk hierarchy (available here, later published in 2002) in which they consider various algorithmic complexity classes, which involve iterated exponentials. They use the notation (base e) and (base 2) for iterated exponentials. I believe this is the earliest reference to what has evolved into notation.

2001

Harvey M. Friedman writes Long Finite Sequences (available here)

Yunhi Cho and Kyunghwan Park write Inverse Functions of (available where?) uses MacDonnell's hyperpower terminology.

Andrew Robbins