What is the Hyperoperation Hierarchy and How Does it Work?

  • Thread starter LFBP
  • Start date
In summary, the conversation discusses the hierarchy of operations, specifically tetration and pentation, and how they can be difficult to understand intuitively. The concept of recursion is used to explain how tetration and pentation are related to exponentiation and multiplication, respectively. The conversation also touches on the concept of zeration and the general formula for hyperoperations. The conversation concludes with the reminder that the operands and rank should be non-negative integers.
  • #1
LFBP
3
0
I'm having some difficulty grasping the hierarchy of operations and the recurrent dynamics that characterize them, can anyone explain in layman's terms? (text rather than symbols is preferable as I want to learn theory intuitively)
 
Mathematics news on Phys.org
  • #2
So in other words, you want to have a more intuitive understanding of how tetration, pentation etc. is developed?

I'm sure you probably find tetration (which we'll denote by a double up arrow, analogous to the single up arrow ^ used for exponentiation) to be easy to grasp, as a^^b is simply exponentiating b times (a power tower of a's that is b high, solved right to left, or at the top of the power tower then working downwards). The reason this is simple is because you already understand exponentiation. For a young student that only knows up to multiplication, it would be fairly simple for them to grasp the concept of exponentiation as a^b is the value a multiplied together b times, and similarly, for a student to learn multiplication, a*b is just a added together b times. Notice that with recursion, if you understand a certain level, then you can easily learn the next level.

So the next step is pentation. Well obviously by recursion, a^^^b would be the value of a tetrated b times. But what does this mean? It's not as easy now because tetration isn't something that we've been exposed to very much, but we have shown that it is equivalent to saying how high the power tower should be. So then a^^^b is saying that we calculate a^^a (a tetrated a times) which gives us a new number (unfathomably large for a>3) and then we calculate a^^(a^^a) which is a stack of a's in a power tower that is a^^a high. Repeat this process until we've used up b amount of a's.

Beyond this it gets even fuzzier. Intuitively understanding the next step gets farther out of reach, which is why we use mathematics. Recursive operations allow us to follow the pattern without having to know where we are exactly or where we're going to end up.
 
  • #3
much appreciated, i'll parse this and then familiarize myself with the symbolic denotations and directional associativity eventually, but wrapping my head around the infinite nature of the operative sequence (especially hypers n>4) is indeed 'brain-breaking' for me (as of yet) and zeration in particular perplexes me, but with such helpful replies^ the notions assimilate clearly.
 
  • #4
You could think of it this way:
Let n = "rank" of operation, a = left operand, b = right operand

operation(n, a, b) = operation(n-1, a, operation(a, n, b-1)
operation(0, a, b) = b+1
operation(n, a, 0) = a if n=0
0 if n=1
1 if n>1

This notion of hyperoperations hold true no matter what n you plug in

Ofc, a,b,n should be non negative integers
 
  • #5
Much appreciated.
 

What is Hyperoperation Hierarchy?

Hyperoperation hierarchy is a mathematical concept that involves a sequence of operations, starting with addition, multiplication, exponentiation, and continuing to higher levels of operations such as tetration, pentation, and beyond.

Why is Hyperoperation Hierarchy important?

Hyperoperation hierarchy is important because it helps us understand the relationship and patterns between different mathematical operations. It also has applications in fields such as computer science, physics, and cryptography.

What is the difference between Hyperoperation Hierarchy and regular arithmetic?

Hyperoperation hierarchy is an extension of regular arithmetic, where the operations become more complex and powerful as we move up the hierarchy. For example, while regular arithmetic only includes addition, multiplication, and exponentiation, hyperoperation hierarchy includes operations like tetration and pentation.

How is Hyperoperation Hierarchy calculated?

Hyperoperation hierarchy is calculated by following a set of rules and patterns. For example, to calculate tetration, we repeatedly raise a number to itself, with the number of iterations equal to the previous number in the sequence. So, for tetration, we would have a^a^a^a, with "a" being repeated "a" times.

What are the practical applications of Hyperoperation Hierarchy?

Hyperoperation hierarchy has practical applications in fields such as computer science, physics, and cryptography. In computer science, it is used in the analysis of algorithms and data structures. In physics, it is used in the study of complex systems and fractals. In cryptography, it is used in creating more secure encryption methods.

Similar threads

Replies
3
Views
259
  • General Math
Replies
7
Views
2K
Replies
1
Views
72
  • Topology and Analysis
Replies
11
Views
248
  • STEM Academic Advising
Replies
14
Views
688
  • Beyond the Standard Models
Replies
4
Views
2K
Replies
9
Views
4K
Replies
5
Views
1K
Writing: Input Wanted Captain's choices on colony ships
  • Sci-Fi Writing and World Building
Replies
4
Views
2K
Back
Top