The hyperoperation hierarchy successively iterates basic arithmetic operations. In the usual indexing, successor is followed by addition, multiplication, exponentiation and their higher iterates. A sequence beginning with addition shifts this index by one. Each fixed rank is a primitive recursive function; this does not imply that the evaluator taking the rank as an additional variable is primitive recursive.
Articles by others on the same topic
Hyperoperations form a sequence of operations that extend beyond basic arithmetic operations (addition, multiplication, exponentiation) to more complex operations. The sequence of hyperoperations is defined recursively, starting from finite addition and building up through various levels of operations. Each level of hyperoperation is defined in terms of the previous level. Here's a brief overview of the first few hyperoperations: 1. **Addition (n=0)**: The first hyperoperation, defined as \( a + b \).