In mathematics, the hyperoperation sequence is an infinite sequence of arithmetic operations (called hyperoperations in this context) that starts with a unary operation (the successor function with n = 0). The sequence continues with the binary operations of addition (n = 1), multiplication (n = 2), and exponentiation (n = 3). It may also be defined according to the recursion rule part of the definition, as in Knuth's up-arrow version of the Ackermann function: This recursion rule is common to many variants of hyperoperations.
|is dbo:wikiPageDisambiguates of|
|is dbo:wikiPageRedirects of|
|is dbo:wikiPageWikiLink of|
|is foaf:primaryTopic of|