# Array notation

Array notation is a kind of notation for large numbers. Comparing to combinatoric functions, array notation has more complex definition, but easier to evaluate. We’ve known some array notations, such as Bowers’ exploding array function (BEAF), Bird’s array notation (BAN), extensible-E system (ExE), and hyperfactorial array notation (HAN).

Here I bring a strong array notation, and it goes far away from the notations mentioned above. It’s made up of several parts shown below.

These 5 parts don’t work.

After fixing the problem in NDAN, we have these parts.

## 41 thoughts on “Array notation”

1. Aarex Tiaokhiao says:

What is the limit of SAN with your plans?

Like

2. Samuel Fields says:

Does anyone know how many symbols it would take to define (pDDN) in the language of First Order Set Theory (FOST)?

Like

• Aarex Tiaokhiao says:

maybe 200.

Like

3. Samuel Fields says:

Hypcos how many levels of (pDDN) would it take to reach Rayo’s number?

Like

• legionmammal978 says:

Uncomputably many levels. All these notations are actually computable.

Like

• Aarex Tiaokhiao says:

Even BIG FOFT, okay how about the limit of pDAN?

Like

4. Aarex Tiaokhiao says:

SAN can be extended: +’ is dropper-droppers for ::::…+ and ++ is dropper-droppers for +::::…, then we can defined nested droppers for +++…., like (N^+)

Like

5. Samuel Fields says:

Hypcos what are the circles (o) used for in your Strong Array Notation?

Like

• The circle is a dropper in NDAN. Read the NDAN page for more details.

Like

6. Samuel Fields says:

Hypcos which part of your Strong Array Notation has recursion level psi(OMEGA omega)?

Like

• The limit growth rate of mEAN is ψ(Ω_ω).

Like

• Samuel Fields says:

So that is comparable to legion array space?

Like

• BEAF is not well-defined beyond tetrational arrays, and so is legion array space.

Like

• Samuel Fields says:

Okay.

Like

7. Samuel Fields says:

Hypcos which part of your Strong Array Notation has the Large Veblen Ordinal (LVO)?

Like

• Separator {1{1`1`2`}2} has recursion level LVO, and first appears in expanding array notation (EAN).

Like

8. Samuel Fields says:

Hypcos how would you describe TREE(3) with your Strong Array Notation?

Like

• The value of TREE(3) is too hard to work out. It has a lower bound of s(3, s(3, 262138 {1 {1`1,2 `} 2} 2) {1 {1`1,2 `} 2} 2 {1 {1`1,2 `} 5} 2). However, its upper bounds are much weaker, because we don’t know the growth rate of TREE(n). We just know TREE(3)<SSCG(3), where SSCG(n) grows slower than s(n,n{1,,2,2}2).
So s(3, s(3, 262138 {1 {1`1,2 `} 2} 2) {1 {1`1,2 `} 2} 2 {1 {1`1,2 `} 5} 2) < TREE(3) << s(3,3 {1,,2,2} 2).

Like

• Samuel Fields says:

Cool.

Like

9. Samuel Fields says:

Hypcos how would you describe a Golapulus (10^100 & 10 & 10) with your Strong Array Notation?
Where would a Golapulus be in your Strong Array Notation?

Like

• Aarex Tiaokhiao says:

Impossible

Like

10. Samuel Fields says:

Hypcos how would you describe a 10^100 array of 10s array of 10s with your Strong Array Notation?

Like

• That would be approximately s(10,s(10,s(10,100){2}2){2}2) in exAN.

Like

• Aarex Tiaokhiao says:

You are wrong. & isn’t defined.

Like

11. Samuel Fields says:

Hyp cos how would you express Meameamealokkapoowa Oompa with your Strong Array Notation?

Like

• Meameamealokkapoowa Oompa is not well-defined. What’s more, Bowers’ googolisms beyond triakulus are not well-defined.

Like

• Samuel Fields says:

Okay.

Like

• Aarex Tiaokhiao says:

So we express BEAF up to {1,,2} separator?

Like

Indeed. {1,,2} is the same level as tettrational BEAF arrays.

However BEAF and SAN are not equivalent at that point.

Like

12. Aarex Tiaokhiao says:

Why you ran out of ideas about extensions?

Like

• Samuel Fields says:

Aarex I am a huge fan of your work with large numbers. I have been studying your work with large numbers for years. Could you show me the steps to go from Otoperoogol to Otopersuperoogol? These numbers are listed on your Extensible Up-arrow System part 4 Dimensional/Nested Array Up-arrow webpage.

Like

• Aarex Tiaokhiao says:

My old googology site is closed, silly you.

Like

The question was asked before you closed it, silly. And I’m sure he’ll find the time to bring back the extended arrow notation some time in the future…

And he’s made primary dropper-dropping notation, part 12. Whether he plans to make a part 13, I don’t know.

Like

• Aarex Tiaokhiao says:

I have the idea on pDDN notation, going beyond than +.

Like

13. legionmammal978 says:

What’s the definition of the iterator in exAN?

Like

• Aarex Tiaokhiao says:

Iterator is defined as the 2nd entry (not in separators) in the array.

Like

14. chronolegends says:

Cant you like, fix it?

Like

• Deedlit says:

It seems like he already has. (or at least tried to) The new NDAN is a replacement for the old one, and WDEN and mWDEN are analogues to DEN and mDEN. WDmEN seems to go a different direction from soDEN and hoDEN; perhaps he sees this as a better/stronger way to extend things.

Like

• Aarex Tiaokhiao says:

Can you make the new version of DEN? (sDEN)

Like

15. Can you explain in more detail why the latter five parts don’t work?

Like

• Aarex Tiaokhiao says:

In NDAN, there is the problem cause infinite loop.

Like