Array notation from my website endless possiblities part 2.
This is part 2: I will be starting at {K:↑(ω+1)(X)} then moving on from there.
{K:↑(ω+1)(X)} = {K:↑(ω)(X)} recursed ({K:↑(ω)(X)}-1) times.
{K:↑(ω2)(X)} = {K:↑(ω+ω)(X)}= {K:↑(ω+X)(X)} = {K:↑(ω+X-1)(X)} recursed ({K:↑(ω+X)(X)}-1) times.
{K:↑(ω3)(X)}= {K:↑(ω2+x)(X)} = {K:↑(ω2+X-1)(X)} recursed ({K:↑(ω2+X-1)(X)}-1)times.
{K:↑(ω^2)(X)}= {K:↑(ω*ω)(X)}= {K:↑(ω*X)(X)} = {K:↑(ω*X-1)(X)} recursed ({K:↑(ω*X-1)(X)}-1) times.
{K:↑(ω^ω)(X)} = {K:↑(ω^X)(X)}= {K:↑(ω^X-1)(X)} recursed ({K:↑(ω^X-1)(X)}-1)times.
{K:↑(ω^ω+(1))(X)} = {K:↑(ω^ω)(X)} recursed ({K:↑(ω^ω)(X)}-1) times.
{K:↑(ω^ω+(ω))(X)} = {K:↑(ω^ω+(X))(X)} = {K:↑(ω^ω+(X-1))(X)} recursed ({K:↑(ω^ω+(ω))(X-1)}-1) times.
{K:↑(ω^ω+(ω+1))(X)} = {K:↑(ω^ω+(ω))(X)} recursed ({K:↑(ω^ω+(ω))(X)}-1)times.
{K:↑(ω^ω+(ω2)…
Array notation examples and possible names.
In this post I will give you some examples for the notation I started to develop on my site Endless Possibilities,As well as a suitable/creative name.Some of the names are quite surreal so be prepared.
Starting with the basics:{a}
{100} = one hundred.
{a,b}
{10,100} = 10^100 = one googol. {a,b,c}
{10,10,10} = 10↑(10)10 = 10{10 up arrows}10 = Destratollion.
{a,b,c,d}
{3,3,3,3} = tree-beardi
{3,3,3,3,3} = triple-tree Moving on to {K&L}
{6&5} = {5,5,5,5,5,5} = unarypenillion.
{(4&4)&4} = tetragramattonillion.
{((4&4)&4)&4} = hyper-tetragramattonillion.
{100(100)100} = metatronillion.
{25++:(12)} = Reindeer number.
{25**:(12)} = super reindeer number.
{34:↑(1)(29)} = the invincible king of doom.
{5:↑(ω)(6)} = {5:↑(6)(6)} = K-9 mark 2000,000.
I'm not going to …
Array notation from my website endless possiblities.
This is (part of) the array of the Array notation I have started to define on my site endless possibilities.
{a} = a.
{a,b} = a^b
{a,b,c} = a↑(b c = a{b up arrow's}c
{a,b,c,d} = {a,b,c} recursed d-1 times for d>1.
for example:
{3,3,3,3} = 3↑(3↑(3↑(3)3)3)3.
In this way we can reach numbers like grahams number of {3,4,3,64} with ease.
After thinking for a bit back when I first started developing this notation I decided to change things was I got to a 5 entry array and above.
{a,b,c,d,e} = {a,b,c,d} recursed ({a,b,c,d}-1) times for e-1 repeats.
With that I then defined k tuples or arrays of length>=5 to be:
{k-1 tuple} recursed ({k-1 tuple}-1) times for the limit (entry/symbol)-1 repeats.
As shown above: with {a,b,c,d,e}.
Next I introduced a symbol & to …
Big 60 (a number from my site Endless possibilities).
Here's a number I have defined from my site endless possibilities called Big 60:
{60↑(60):(60)}
To understand how this number is derived I would like to refer you to the 1st two pages in my extremely large numbers series:
https://sites.google.com/view/endless-possibilities/extremely-large-numbers-part-1
https://sites.google.com/view/endless-possibilities/extremely-large-numbers-part-2
When you are finished reading the required pages I would like to know what people think of Big 60.
Links to the notation from my site endless possibilities.
Here are some links to key googology pages on my website Endless possibilities hope you enjoy. https://sites.google.com/view/endless-possibilities/extremely-large-numbers-part-1
https://sites.google.com/view/endless-possibilities/extremely-large-numbers-part-2
https://sites.google.com/view/endless-possibilities/extremely-large-numbers-part-3
https://sites.google.com/view/endless-possibilities/extremely-large-numbers-part-4
https://sites.google.com/view/endless-possibilities/extremely-large-numbers-part-5
https://sites.google.com/view/endless-possibilities/extremely-large-numbers-part-6