## Your number is, in fact, not bigger!

**Moderators:** jestingrabbit, Moderators General, Prelates

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

(Also, I thought about a second argument to show how 4[0-0-[0-0,0-0]] can't be 5[0-0,0-0] - At the very base of the continuation of my progression, I have 4[0-0-[0-0,0-0]],0 = n[0-0-[0-0,0-0]] n[0-0-[0-0,0-0]] n[0-0-[0-0,0-0]] n[0-0-[0-0,0-0]] 4[0-0-[0-0,0-0]] i.e. there's nesting applied to the previous function. It means 2[0-0-[0-0,0-0]],0 is (((2[0-0-[0-0,0-0]])[0-0-[0-0,0-0]])[0-0-[0-0,0-0]]) which is already much larger than 5[0-0-[0-0,0-0]])

I know how to pass that in my notation, unfortunately ordinal plugging leads to confusion, so I'll continue the previous notation with relevant parts bolded.

n[[[0-0,0-0]]] = n[[0-0,0-0]]~[[0-0,0-0]]~

n[[[[0-0,0-0]]]] = n[[[0-0,0-0]]]~[[[0-0,0-0]]]~

n[0-[0-0,0-0]] = n[~[0-0,0-0]~]~[~[0-0,0-0]~]~

n[0-[0-0,0-0],0] = n[0-[0-0,0-0]]~[0-[0-0,0-0]]~

n[0-[0-0,0-0],1] = n[0-[0-0,0-0],0,~]

n[0-[0-0,0-0],[0]] = n[0-[0-0,0-0],n]

n[0-[0-0,0-0],[0],[0]] = n[0-[0-0,0-0],[0],n]

n[0-[0-0,0-0],0,[0]] = n[0-[0-0,0-0],[0],~]

n[0-[0-0,0-0],[0]~[0]] = n[0-[0-0,0-0],n,[0]]

n[0-[0-0,0-0],[0,0]] = n[0-[0-0,0-0],[0]~[0]~]

n[0-[0-0,0-0],[1]] = n[0-[0-0,0-0],[0,~]]

n[0-[0-0,0-0],[[0]]] = n[0-[0-0,0-0],[n]]

n[0-[0-0,0-0],[0-0]] = n[0-[0-0,0-0],[~[0]~]]

n[0-[0-0,0-0],[0-0-0]] = n[0-[0-0,0-0],[~[1-0]-0~]]

n[0-[0-0,0-0],[0-0-[0-0-0]]] = n[0-[0-0,0-0],[0-0-[~[1-0]-0~]]]

n[0-[0-0,0-0],[0-0,0-0]]] = n[0-[0-0,0-0],[0-0-[~0-0-[0-0-0]~]]]

n[0-[0-0,0-0],[0-0,0-0],[0-0,0-0]]] = n[0-[0-0,0-0],[0-0,0-0],[0-0-[~0-0-[0-0-0]~]]]

n[0-0,[0-0,0-0]] = n[0-[0-0,0-0],~]

n[0-0,0,[0-0,0-0]] = n[0-0,[0-0,0-0],~~]

n[0-1,[0-0,0-0]] = n[0-0,~[0-0,0-0]]

n[0-[0],[0-0,0-0]] = n[0-n,[0-0,0-0]]

n[0-[0]~[0],[0-0,0-0]] = n[0-n,n,[0-0,0-0]]

n[0-[0,0],[0-0,0-0]] = n[0-[0]~[0]~[0-0,0-0]]

n[0-[1],[0-0,0-0]] = n[0-[0,~],[0-0,0-0]]

n[0-[[0]],[0-0,0-0]] = n[0-[n],[0-0,0-0]]

n[0-[0-0],[0-0,0-0]] = n[0-[~[0]~],[0-0,0-0]]

n[0-[0-0-0],[0-0,0-0]] = n[0-[~[1-0]-0~],[0-0,0-0]]

n[0-[0-0,0-0]~[0-0,0-0]] = n[0-[0-0-[~0-0-[0-0-0]~],[0-0,0-0]]

n[0-[0-0,0-0]~[0-0,0-0]~[0-0,0-0]] = n[0-[0-0-[~0-0-[0-0-0]~]~[0-0,0-0]]

n[0-[[0-0,0-0]]] = n[0-[0-0,0-0]~[0-0,0-0]~]

n[0-[[[0-0,0-0]]]] = n[0-[[0-0,0-0]]~[[0-0,0-0]]~]

n[0-[0-[0-0,0-0]]] = n[0-[~[0-0,0-0]~]~[~[0-0,0-0]~]~]

n[0,0-[0-0,0-0]] = n[0-[0-~[0-0,0-0]~]]

n[0,0,0-[0-0,0-0]] = n[0,0-[0,0-~[0-0,0-0]~]]

n[1-[0-0,0-0]] = n[0,~-[0,~-~[0-0,0-0]~]]

n[[0]-[0-0,0-0]] = n[n-[n-~[0-0,0-0]~]]

n[[1]-[0-0,0-0]] = n[[0,~]-[[0,~]-~[0-0,0-0]~]]

n[[[0]]-[0-0,0-0]] = n[[n]-[[n]-~[0-0,0-0]~]]

n[[0-0]-[0-0,0-0]] = n[[~[0]~]-[[~[0]~]-~[0-0,0-0]~]]

n[[0-[0-0,0-0]]-[0-0,0-0]] = n[[~[0-0,0-0]~]~[~[0-0,0-0]~]~-[[~[0-0,0-0]~]~[~[0-0,0-0]~]~-~[0-0,0-0]~]]

n[0-0-[0-0,0-0]] = n[~[~0-[0-0,0-0]~-[0-0,0-0]~]-[0-0,0-0]] = φ(1,1,1)

(Not n[0-0-[0-0,0-0]] = n[0-0-[0-0-[~0-0-[0-0-0]~]], which is from where the confusion came from - whenever some ordinal equivalent is nested it's harder to make it go up, all the previous bolded parts would now go up to this limit.)

And it begins again inside of n[0-0-X], i.e. all the stuff I've put on this post fits on X

...

n[0-0-[[0-0]-[0-0,0-0]]] = n[0-0-[~0-0[~[0]~]-[[~[0]~]-~[0-0,0-0]~]~]]

n[0-0-[[0-[0-0,0-0]]-[0-0,0-0]]] = n[0-0-[~0-0[[~[0-0,0-0]~]~[~[0-0,0-0]~]~-[[~[0-0,0-0]~]~[~[0-0,0-0]~]~-~[0-0,0-0]~]~]]

n[0-0,0-0,0] = n[0-0-~[0-0-~0-[0-0,0-0]~-[0-0,0-0]~]-[0-0,0-0]] = φ(1,1,2)

n[0-0,0-0,0,0] = n[0-0-~[0-0-~0-[0-0,0-0,0]~-[0-0,0-0,0]~]-[0-0,0-0,0]] = φ(1,1,3)

n[0-0,0-0,0,0,0] = n[0-0-~[0-0-~0-[0-0,0-0,0,0]~-[0-0,0-0,0,0]~]-[0-0,0-0,0,0]] = φ(1,1,4)

n[0-0,0-1] = n[0-0-~[0-0-~0-[0-0,0-0,~]~-[0-0,0-0,~]~]-[0-0,0-0,~]] = φ(1,1,ω)

n[0-0,0-2] = n[0-0-~[0-0-~0-[0-0,0-0,~1]~-[0-0,0-0,~1]~]-[0-0,0-0,~1]] = φ(1,1,ω^ω)

n[0-0,0-3] = n[0-0-~[0-0-~0-[0-0,0-0,~1,2]~-[0-0,0-0,~1,2]~]-[0-0,0-0,~1,2]] = φ(1,1,ω^ω^ω)

Send:

4[0-0,0-[0]]

Where: [0-0,0-[0]] = [0-0,0-n] for φ(1,1,ε_0)

----

Explanation:

I have some notation X, then I add a box, [X], and I can then put stuff inside this box up to [~[X]~], which is the limit of the boxes. However, once I reach a new place, I go back to these boxes, and can put something new in [X], which is now more powerful. And I do that with [0-X], and [0,0-X], and [0-0-X]... So that there's always a symbol that never appears in X, and once I create it, I can go back and reuse the same symbols for much stronger representations of recursions.

I know how to pass that in my notation, unfortunately ordinal plugging leads to confusion, so I'll continue the previous notation with relevant parts bolded.

n[[[0-0,0-0]]] = n[[0-0,0-0]]~[[0-0,0-0]]~

n[[[[0-0,0-0]]]] = n[[[0-0,0-0]]]~[[[0-0,0-0]]]~

n[0-[0-0,0-0]] = n[~[0-0,0-0]~]~[~[0-0,0-0]~]~

n[0-[0-0,0-0],0] = n[0-[0-0,0-0]]~[0-[0-0,0-0]]~

n[0-[0-0,0-0],1] = n[0-[0-0,0-0],0,~]

n[0-[0-0,0-0],[0]] = n[0-[0-0,0-0],n]

n[0-[0-0,0-0],[0],[0]] = n[0-[0-0,0-0],[0],n]

n[0-[0-0,0-0],0,[0]] = n[0-[0-0,0-0],[0],~]

n[0-[0-0,0-0],[0]~[0]] = n[0-[0-0,0-0],n,[0]]

n[0-[0-0,0-0],[0,0]] = n[0-[0-0,0-0],[0]~[0]~]

n[0-[0-0,0-0],[1]] = n[0-[0-0,0-0],[0,~]]

n[0-[0-0,0-0],[[0]]] = n[0-[0-0,0-0],[n]]

n[0-[0-0,0-0],[0-0]] = n[0-[0-0,0-0],[~[0]~]]

n[0-[0-0,0-0],[0-0-0]] = n[0-[0-0,0-0],[~[1-0]-0~]]

n[0-[0-0,0-0],[0-0-[0-0-0]]] = n[0-[0-0,0-0],[0-0-[~[1-0]-0~]]]

n[0-[0-0,0-0],[0-0,0-0]]] = n[0-[0-0,0-0],[0-0-[~0-0-[0-0-0]~]]]

n[0-[0-0,0-0],[0-0,0-0],[0-0,0-0]]] = n[0-[0-0,0-0],[0-0,0-0],[0-0-[~0-0-[0-0-0]~]]]

n[0-0,[0-0,0-0]] = n[0-[0-0,0-0],~]

n[0-0,0,[0-0,0-0]] = n[0-0,[0-0,0-0],~~]

n[0-1,[0-0,0-0]] = n[0-0,~[0-0,0-0]]

n[0-[0],[0-0,0-0]] = n[0-n,[0-0,0-0]]

n[0-[0]~[0],[0-0,0-0]] = n[0-n,n,[0-0,0-0]]

n[0-[0,0],[0-0,0-0]] = n[0-[0]~[0]~[0-0,0-0]]

n[0-[1],[0-0,0-0]] = n[0-[0,~],[0-0,0-0]]

n[0-[[0]],[0-0,0-0]] = n[0-[n],[0-0,0-0]]

n[0-[0-0],[0-0,0-0]] = n[0-[~[0]~],[0-0,0-0]]

n[0-[0-0-0],[0-0,0-0]] = n[0-[~[1-0]-0~],[0-0,0-0]]

n[0-[0-0,0-0]~[0-0,0-0]] = n[0-[0-0-[~0-0-[0-0-0]~],[0-0,0-0]]

n[0-[0-0,0-0]~[0-0,0-0]~[0-0,0-0]] = n[0-[0-0-[~0-0-[0-0-0]~]~[0-0,0-0]]

n[0-[[0-0,0-0]]] = n[0-[0-0,0-0]~[0-0,0-0]~]

n[0-[[[0-0,0-0]]]] = n[0-[[0-0,0-0]]~[[0-0,0-0]]~]

n[0-[0-[0-0,0-0]]] = n[0-[~[0-0,0-0]~]~[~[0-0,0-0]~]~]

n[0,0-[0-0,0-0]] = n[0-[0-~[0-0,0-0]~]]

n[0,0,0-[0-0,0-0]] = n[0,0-[0,0-~[0-0,0-0]~]]

n[1-[0-0,0-0]] = n[0,~-[0,~-~[0-0,0-0]~]]

n[[0]-[0-0,0-0]] = n[n-[n-~[0-0,0-0]~]]

n[[1]-[0-0,0-0]] = n[[0,~]-[[0,~]-~[0-0,0-0]~]]

n[[[0]]-[0-0,0-0]] = n[[n]-[[n]-~[0-0,0-0]~]]

n[[0-0]-[0-0,0-0]] = n[[~[0]~]-[[~[0]~]-~[0-0,0-0]~]]

n[[0-[0-0,0-0]]-[0-0,0-0]] = n[[~[0-0,0-0]~]~[~[0-0,0-0]~]~-[[~[0-0,0-0]~]~[~[0-0,0-0]~]~-~[0-0,0-0]~]]

n[0-0-[0-0,0-0]] = n[~[~0-[0-0,0-0]~-[0-0,0-0]~]-[0-0,0-0]] = φ(1,1,1)

(Not n[0-0-[0-0,0-0]] = n[0-0-[0-0-[~0-0-[0-0-0]~]], which is from where the confusion came from - whenever some ordinal equivalent is nested it's harder to make it go up, all the previous bolded parts would now go up to this limit.)

And it begins again inside of n[0-0-X], i.e. all the stuff I've put on this post fits on X

...

n[0-0-[[0-0]-[0-0,0-0]]] = n[0-0-[~0-0[~[0]~]-[[~[0]~]-~[0-0,0-0]~]~]]

n[0-0-[[0-[0-0,0-0]]-[0-0,0-0]]] = n[0-0-[~0-0[[~[0-0,0-0]~]~[~[0-0,0-0]~]~-[[~[0-0,0-0]~]~[~[0-0,0-0]~]~-~[0-0,0-0]~]~]]

n[0-0,0-0,0] = n[0-0-~[0-0-~0-[0-0,0-0]~-[0-0,0-0]~]-[0-0,0-0]] = φ(1,1,2)

n[0-0,0-0,0,0] = n[0-0-~[0-0-~0-[0-0,0-0,0]~-[0-0,0-0,0]~]-[0-0,0-0,0]] = φ(1,1,3)

n[0-0,0-0,0,0,0] = n[0-0-~[0-0-~0-[0-0,0-0,0,0]~-[0-0,0-0,0,0]~]-[0-0,0-0,0,0]] = φ(1,1,4)

n[0-0,0-1] = n[0-0-~[0-0-~0-[0-0,0-0,~]~-[0-0,0-0,~]~]-[0-0,0-0,~]] = φ(1,1,ω)

n[0-0,0-2] = n[0-0-~[0-0-~0-[0-0,0-0,~1]~-[0-0,0-0,~1]~]-[0-0,0-0,~1]] = φ(1,1,ω^ω)

n[0-0,0-3] = n[0-0-~[0-0-~0-[0-0,0-0,~1,2]~-[0-0,0-0,~1,2]~]-[0-0,0-0,~1,2]] = φ(1,1,ω^ω^ω)

Send:

4[0-0,0-[0]]

Where: [0-0,0-[0]] = [0-0,0-n] for φ(1,1,ε_0)

----

Explanation:

I have some notation X, then I add a box, [X], and I can then put stuff inside this box up to [~[X]~], which is the limit of the boxes. However, once I reach a new place, I go back to these boxes, and can put something new in [X], which is now more powerful. And I do that with [0-X], and [0,0-X], and [0-0-X]... So that there's always a symbol that never appears in X, and once I create it, I can go back and reuse the same symbols for much stronger representations of recursions.

### Re: Your number is, in fact, not bigger!

That sort of reminds me of the boxes from illusory space

### Re: Your number is, in fact, not bigger!

It actually can be done, because there is an ordinal representation for what he wanted to do but was having trouble expressing with illusory space. This may or may not be exactly what he wanted, but on the face of it, there's nothing wrong. I haven't done a precise analysis to ensure there's no errors at all, but it looks right-ish so I'm not contesting it.

[2|0[ :0[][]:0[]] for φ(1,φ(1,0),0)

[2|0[ :0[][]:0[]] for φ(1,φ(1,0),0)

All Shadow priest spells that deal Fire damage now appear green.

Big freaky cereal boxes of death.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

The thing of Illusory space is that I can plop it to any other notation, so, say, I could add ''s around my boxes and claim "that's Illusory Space, and 4[0] is 4'[0-0,0-[0]]', And that's Level 0, and in Level 0,0 you add n[0] 's, and in level 0,0,0 you add 4<big ordinal> 's", and then I'd say "That's Layer 0 of Illusory space, in Layer 0,0 you go to imaginary level 4[0] of Layer 0 to add that many 's", and so on.

I may have to go with it once this notation runs out, but I think it has good fuel left...

n[0-0,0-[[0]]] = n[0-0,0-[n]] = φ(1,1,ε_ε_0)

n[0-0,0-[0-0]] = n[0-0,0-[~[0]~]] = φ(1,1,φ(2,0))

n[0-0,0-[0,0-0]] = φ(1,1,φ(3,0))

n[0-0,0-[0,0,0-0]] = φ(1,1,φ(4,0))

n[0-0,0-[0-0,0-0]] = φ(1,1,φ(1,1,0))

n[0-0,0-[0-0,0-[0-0,0-0]]] = φ(1,1,φ(1,1,φ(1,1,φ(1,1,0))))

n[0-0,0,0-0] = n[0-0,0-[~0-0,0-[0-0,0-0]~]] φ(1,2,0)

n[0-0,0,0,0-0] = n[0-0,0,0-[~0-0,0,0-[0-0,0,0-0]~]] φ(1,3,0)

n[0-1-0] = n[0-0,~-0] φ(1,ω,0)

n[0-[0]-0] = n[0-n-0] φ(1,ε_0,0)

n[0-[[0]]-0] = n[0-[n]-0] φ(1,ε_ε_0,0)

n[0-[0-0]-0] = n[0-[~[0]~]-0]

Send:

4[0-[0-0]-0]

For f_φ(1,φ(2,0),0)(4)

I may have to go with it once this notation runs out, but I think it has good fuel left...

n[0-0,0-[[0]]] = n[0-0,0-[n]] = φ(1,1,ε_ε_0)

n[0-0,0-[0-0]] = n[0-0,0-[~[0]~]] = φ(1,1,φ(2,0))

n[0-0,0-[0,0-0]] = φ(1,1,φ(3,0))

n[0-0,0-[0,0,0-0]] = φ(1,1,φ(4,0))

n[0-0,0-[0-0,0-0]] = φ(1,1,φ(1,1,0))

n[0-0,0-[0-0,0-[0-0,0-0]]] = φ(1,1,φ(1,1,φ(1,1,φ(1,1,0))))

n[0-0,0,0-0] = n[0-0,0-[~0-0,0-[0-0,0-0]~]] φ(1,2,0)

n[0-0,0,0,0-0] = n[0-0,0,0-[~0-0,0,0-[0-0,0,0-0]~]] φ(1,3,0)

n[0-1-0] = n[0-0,~-0] φ(1,ω,0)

n[0-[0]-0] = n[0-n-0] φ(1,ε_0,0)

n[0-[[0]]-0] = n[0-[n]-0] φ(1,ε_ε_0,0)

n[0-[0-0]-0] = n[0-[~[0]~]-0]

Send:

4[0-[0-0]-0]

For f_φ(1,φ(2,0),0)(4)

### Re: Your number is, in fact, not bigger!

Excellent! Let the rampant 1-upmanship continue unabated.

[2|0[ :[ : :0[]]:0[]]] for f{φ(1,φ(1,0,0),0)}(2)

[2|0[ :[ : :0[]]:0[]]] for f{φ(1,φ(1,0,0),0)}(2)

All Shadow priest spells that deal Fire damage now appear green.

Big freaky cereal boxes of death.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

Okay, I've had enough.

Define:

n[X-Y]

Compute n[X] and Compute n[Y].

If X produces a larger number then return:

n[X-[X-...[X-y]] for n -s

Where y follows the rules of n,X (i.e. if y is a 1 it becomes 0,0,...,0,0 with n ,s, if it's [[0]] it becomes an n)

If Y is 0 return: n[x-[x-...[x-0]] for n -s

If Y produces a larger number then return:

n[x-[x-...[x-Y]] for n -s

Where x follows the rules of n,X (i.e. if x is a 1 it becomes 0,0,...,0,0 with n ,s, if it's [[0]] it becomes an [n])

If X is 0 return:

n[0-y]

--------

Define:

n[X-Y-Z]. Compute n[X], n[Y] and n[Z].

If n[Z] produces the largest number and n[Y] => n[X]:

Return: n[X-Y-[X-Y-...[X-Y-z]]]] for n[X-Y-z] -s (note: n*2 -s suffice here)

Where z follows the rules of n,X

If Z is a 0, return:

n[X-y-[X-y-...[X-y-0]]]] for n[X-y-0] -s

If Y is a 0 (then X is a 0 as well), return:

n[[0-Z]...-Z]-Z] for n[0-Z] -s (note: n -s suffice here)

If n[Z] produces the largest number and n[Y] < n[X]:

Return: n[X-Y-[X-Y-...[X-Y-z]]]] for n[X-Y-z] -s

If Z is a 0, return:

n[X-y-[X-y-...[X-y-0]]]] for n[X-y-0] -s

If Z and Y are 0, return:

n[x-[x-...[x-0-0]...-0]-0] for n[x-Y-0] -s

If n[Y] produces the largest number:

Return:

n[X-Y-[X-Y-...[X-Y-z]]]] for n[X-Y-z] -s

If Z is 0, return:

n[X-y-[X-y-...[X-y-0]]]] for n[X-y-0] -s

If n[X] produces the largest number and Y and Z are 0:

Return:

[x-[x-...[x-0-[x-X-0]]...-0]-0]

--------

There we go, now everything before should work all right, and:

n[0-[0-0-0]-0] = φ(1,φ(1,0,0),0)

n[0-[0-0-[0-0-0]]-0] = φ(1,φ(1,0,1),0)

n[0-[0-0,0-0]-0] = φ(1,φ(1,1,0),0)

n[0-[0-0-[0-0,0-0]]-0] = φ(1,φ(1,1,1),0)

n[0-[0-[0-0-[0-0,0-0]]-0]-0] = φ(1,φ(1,φ(1,1,1),0),0)

n[0-[0-[0-[0-0-[0-0,0-0]]-0]-0]-0] = φ(1,φ(1,φ(1,φ(1,1,1),0),0),0)

n[0,0-0-0] = φ(2,0,0)

n[0,0,0-0-0] = n[0,0-[~[0-0-[0,0-0-0]~]-0]-0] φ(3,0,0)

n[1-0-0] = n[0,~-0-0] φ(ω,0,0)

n[[0]-0-0] = n[n-0-0] φ(ε_0,0,0)

n[[0-0]-0-0] = n[[~[0]~]-0-0] φ(φ(2,0),0,0)

n[[0-0-0]-0-0] = φ(φ(1,0,0),0,0)

n[[1-0-0]-0-0] = φ(φ(ω,0,0),0,0)

n[[[0-0-[0-0-0]]-0-0]-0-0] = φ(φ(1,0,1),0,0)

n[[[[0-0-[0-0-0]]-0-0]-0-0]-0-0] = φ(φ(φ(1,0,1),0,0),0,0)

n[0-0-0-0] = n[~[0-0-[0-0-0]~]-0-0]~-0-0]

Send:

4[0-0-0-0]

For f_φ(1,0,0,0)(4)

Define:

n[X-Y]

Compute n[X] and Compute n[Y].

If X produces a larger number then return:

n[X-[X-...[X-y]] for n -s

Where y follows the rules of n,X (i.e. if y is a 1 it becomes 0,0,...,0,0 with n ,s, if it's [[0]] it becomes an n)

If Y is 0 return: n[x-[x-...[x-0]] for n -s

If Y produces a larger number then return:

n[x-[x-...[x-Y]] for n -s

Where x follows the rules of n,X (i.e. if x is a 1 it becomes 0,0,...,0,0 with n ,s, if it's [[0]] it becomes an [n])

If X is 0 return:

n[0-y]

--------

Define:

n[X-Y-Z]. Compute n[X], n[Y] and n[Z].

If n[Z] produces the largest number and n[Y] => n[X]:

Return: n[X-Y-[X-Y-...[X-Y-z]]]] for n[X-Y-z] -s (note: n*2 -s suffice here)

Where z follows the rules of n,X

If Z is a 0, return:

n[X-y-[X-y-...[X-y-0]]]] for n[X-y-0] -s

If Y is a 0 (then X is a 0 as well), return:

n[[0-Z]...-Z]-Z] for n[0-Z] -s (note: n -s suffice here)

If n[Z] produces the largest number and n[Y] < n[X]:

Return: n[X-Y-[X-Y-...[X-Y-z]]]] for n[X-Y-z] -s

If Z is a 0, return:

n[X-y-[X-y-...[X-y-0]]]] for n[X-y-0] -s

If Z and Y are 0, return:

n[x-[x-...[x-0-0]...-0]-0] for n[x-Y-0] -s

If n[Y] produces the largest number:

Return:

n[X-Y-[X-Y-...[X-Y-z]]]] for n[X-Y-z] -s

If Z is 0, return:

n[X-y-[X-y-...[X-y-0]]]] for n[X-y-0] -s

If n[X] produces the largest number and Y and Z are 0:

Return:

[x-[x-...[x-0-[x-X-0]]...-0]-0]

--------

There we go, now everything before should work all right, and:

n[0-[0-0-0]-0] = φ(1,φ(1,0,0),0)

n[0-[0-0-[0-0-0]]-0] = φ(1,φ(1,0,1),0)

n[0-[0-0,0-0]-0] = φ(1,φ(1,1,0),0)

n[0-[0-0-[0-0,0-0]]-0] = φ(1,φ(1,1,1),0)

n[0-[0-[0-0-[0-0,0-0]]-0]-0] = φ(1,φ(1,φ(1,1,1),0),0)

n[0-[0-[0-[0-0-[0-0,0-0]]-0]-0]-0] = φ(1,φ(1,φ(1,φ(1,1,1),0),0),0)

n[0,0-0-0] = φ(2,0,0)

n[0,0,0-0-0] = n[0,0-[~[0-0-[0,0-0-0]~]-0]-0] φ(3,0,0)

n[1-0-0] = n[0,~-0-0] φ(ω,0,0)

n[[0]-0-0] = n[n-0-0] φ(ε_0,0,0)

n[[0-0]-0-0] = n[[~[0]~]-0-0] φ(φ(2,0),0,0)

n[[0-0-0]-0-0] = φ(φ(1,0,0),0,0)

n[[1-0-0]-0-0] = φ(φ(ω,0,0),0,0)

n[[[0-0-[0-0-0]]-0-0]-0-0] = φ(φ(1,0,1),0,0)

n[[[[0-0-[0-0-0]]-0-0]-0-0]-0-0] = φ(φ(φ(1,0,1),0,0),0,0)

n[0-0-0-0] = n[~[0-0-[0-0-0]~]-0-0]~-0-0]

Send:

4[0-0-0-0]

For f_φ(1,0,0,0)(4)

### Re: Your number is, in fact, not bigger!

Hmm, I think I have discovered a very concise way of expressing your base rule:

(0,X)-- = X

(a,X)-- = (<a-->,a,X--)

(a)-- = (<a-->)

(X,()) = X

Though I believe this is reversed left-right.

With the first rule: 0,0,1,0 -> 0,1,0 -> 1,0

With the second rule, we have 1,0 -> <1-->,1,(0)-- = 0,0,0,0,0,1,(0)-- = 0,0,0,0,0,1,() = 0,0,0,0,0,1

(1,1,0)-- = <1-->,1,(1,0)-- = 0,0,1,(<1-->,1,(0)--) = 0,0,1,0,0,1,() = 0,0,1,0,0,1

Does that sound about right?

(0,X)-- = X

(a,X)-- = (<a-->,a,X--)

(a)-- = (<a-->)

(X,()) = X

Though I believe this is reversed left-right.

With the first rule: 0,0,1,0 -> 0,1,0 -> 1,0

With the second rule, we have 1,0 -> <1-->,1,(0)-- = 0,0,0,0,0,1,(0)-- = 0,0,0,0,0,1,() = 0,0,0,0,0,1

(1,1,0)-- = <1-->,1,(1,0)-- = 0,0,1,(<1-->,1,(0)--) = 0,0,1,0,0,1,() = 0,0,1,0,0,1

Does that sound about right?

All Shadow priest spells that deal Fire damage now appear green.

Big freaky cereal boxes of death.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

Yeah, with rules reversed left-to-right you'd see if the leftmost element is a 0, and if it is, you iterate the function, otherwise, you search for the next element that is bigger than the left-most element, you "decrease" what's left of it, and make n copies of the string.

What is missing on your description is the ~ element:

Once you reach something like (left-to-right):

[0],0

[0],1,0

[0],2,1,0

[0],3,2,1,0

...

In your notation, one would advance to:

[0,0] = [0],3,2,1,0...0

In mine, you go to:

[0]~[0] = [0],3,2,1,0...0

So the ~s work as ,s, allowing for an extra layer of strings before reaching:

[0,0] = [0]~[0]~...~[0]

Because what I had wasn't enough to reach the ordinals I was wanting to reach.

What is missing on your description is the ~ element:

Once you reach something like (left-to-right):

[0],0

[0],1,0

[0],2,1,0

[0],3,2,1,0

...

In your notation, one would advance to:

[0,0] = [0],3,2,1,0...0

In mine, you go to:

[0]~[0] = [0],3,2,1,0...0

So the ~s work as ,s, allowing for an extra layer of strings before reaching:

[0,0] = [0]~[0]~...~[0]

Because what I had wasn't enough to reach the ordinals I was wanting to reach.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

WarDaft wrote:(1,1,0)-- = <1-->,1,(1,0)-- = 0,0,1,(<1-->,1,(0)--) = 0,0,1,0,0,1,() = 0,0,1,0,0,1

Does that sound about right?

Um, it should be (left-to-right):

n[1,1,0] = n[0...0,1,0]~[0...0,1,0]~...~[0...0,1,0] with n ,s inside each box and n ~s.

### Re: Your number is, in fact, not bigger!

I didn't actually want to go that far, was just trying to concisely define the base form. This helps because it has revealed an incongruity in what I thought you were doing.

All Shadow priest spells that deal Fire damage now appear green.

Big freaky cereal boxes of death.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

Oh, we're looking at (from right to left - i.e. my original notation):

n,0,1,1

First:

Is the rightmost element a 0? No.

Then, look for the previous element that is as high as the rightmost element:

0,1,1

This makes the string:

0,1, (1)

I.e. 0,1, is the unchanged prefix.

This means you decrease the string and make n copies.

0,0,1,1 = 0

1,0,1,1 = 1,0,1(,0) = 1,0,1,0,0

2,0,1,1 = 1,0,1(,0,0) = 2,0,1,0,0,0,0,0,0

3,0,1,1 = 3,0,1(,0,0,0) = 3,0,1,0,0,0,0,0,0,0,0,0,0,0,0

4,0,1,1 = 4,0,1(,0,0,0,0) = 4,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0

For f_{ω^2}+ω(n).

n,0,1,1

First:

Is the rightmost element a 0? No.

Then, look for the previous element that is as high as the rightmost element:

0,1,1

This makes the string:

0,1, (1)

I.e. 0,1, is the unchanged prefix.

This means you decrease the string and make n copies.

0,0,1,1 = 0

1,0,1,1 = 1,0,1(,0) = 1,0,1,0,0

2,0,1,1 = 1,0,1(,0,0) = 2,0,1,0,0,0,0,0,0

3,0,1,1 = 3,0,1(,0,0,0) = 3,0,1,0,0,0,0,0,0,0,0,0,0,0,0

4,0,1,1 = 4,0,1(,0,0,0,0) = 4,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0

For f_{ω^2}+ω(n).

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

Okay, there we go, I thought of a way to get rid of all possible incongruities:

Define:

nXY

Where X and Y are strings:

,a,b,c,...

Of finite elements, possibly empty.

n, = n*(2^n)

The bottom case (it's this instead of n+1 so that the new base case produces numbers as high as the old one)

nXY,0 = aXY bXY ... oXY nXY with n spaces

Where o is nXY and a would be bXY, etc.

Define:

X = *,Z

(Z is the rightmost element in X)

Define:

Y = A,*,z

Where:

Z=>z

In other words, Z is the rightmost element in X that is equal or higher than z.

nXY = nXyy...yy for n+1 ys (n ys suffice but number would be lower than old notation)

n,~ = n,n,...,n,n with n ,s

Where:

Y = y

A,*,z = a,*,z

(A is decreased to a)

Decreasing rule:

A = a

0 = ()

n = 0,~1,2,3...n-2,n-1

And that's it.

Example 1:

4,0,1,2,3

z=3

There's no element equal or higher than z, so X is empty.

A=0

4,0,1,2,3 = 4(,1,2,3)

Make 4 copies:

4,0,1,2,3=4,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3

Example 2:

4,3,2,1,0

z=0

4,3,2,1,0 = ((((4,3,2,1),3,2,1),3,2,1),3,2,1),3,2,1

Example 3:

4,3,2,1

z=1

2>z

A=1

X=,3,2

Y=,1

a=0,~

4,3,2,1 = 4,3,2(,0,0,0,0)

Make n copies:

4,3,2,1 = 4,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0

Example 4:

4,0,1,2,3,2,1,0

z=0

4,0,1,2,3,2,1 = ((((4,0,1,2,3,2,1),0,1,2,3,2,1),0,1,2,3,2,1),0,1,2,3,2,1),0,1,2,3,2,1

Example 5:

4,0,1,2,3,2,1

z=1

2>z

A=1

X=,0,1,2,3,2

Y=,1

a=0,~

4,0,1,2,3,2,1 = 4,0,1,2,3,2(,0,0,0,0)

Make n copies:

4,0,1,2,3,2,1 = 4,0,1,2,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0

Example 6:

4,3,2,1,0,1,2,3

z=3

3=z

A=2

X=,3

Y=,2,1,0,1,2,3

a=0,~1

4,3,2,1,0,1,2,3 = 4,3(,0,0,0,0,1,1,0,1,2,3)

Make n copies:

4,3,2,1,0,1,2,3 = 4,3,0,0,0,0,1,1,0,1,2,3,0,0,0,0,1,1,0,1,2,3,0,0,0,0,1,1,0,1,2,3

,0,0,0,0,1,1,0,1,2,3,0,0,0,0,1,1,0,1,2,3

n,n = f_{φ(1,0)}(n)

And now, for an entirely different extension:

n,{0} = n,n

n,{0},0 = a,{0} b,{0} ... o,{0} n,{0} with n spaces

n,{0},0,0 = a,{0},0 b,{0},0 ... o,{0},0 n,{0},0 with n spaces

n,{0},XY

n,0,{0} = n,{0},~

n,{0,0} = n,n+1,{0} = f_{φ(0,φ(1,0)+1)}(n)

n,{0,0,0} = n,n+1,{0},{0,0} = f_{φ(0,φ(0,φ(1,0)+1))}(n)

n,{{0}} = n,{n+1} = f_{φ(1,1)}(n)

n,{{{0}}} = n,{{n+1}} = f_{φ(1,φ(1,0))}(n)

n,{{{{0}}}} = n,{{{n+1}}} = f_{φ(1,φ(1,φ(1,0)))}(n)

n,0~0 = n,{~{0}~} = f_{φ(2,0)}(n)

n,0~0,0 = n,{n+1} = f_{φ(2,0)+1}(n)

n,{0~0,0} = f_{φ(1,φ(2,0)+1)}(n)

n,{{0~0,0}} = f_{φ(1,φ(1,φ(2,0)+1))}(n)

n,0,0~0 = n,{~{0~0,0}~} = f_{φ(2,1)}(n)

n,{0~0,0}~0 = f_{φ(2,φ(2,0)+1)}(n)

n,{{0~0,0}}~0 = f_{φ(2,φ(2,φ(2,0)+1)}(n)

n,0~0~0 = n,{~{0~0,0}~}~0 f_{φ(3,0)}(n)

n,0,, = n,0~ = f_{φ(φ(0,ω),0)}(n)

n,0,,{0,,} = n,0~ = f_{φ(φ(φ(0,ω),0),0)}(n)

n,0,,{0,,{0,,}} = n,0~ = f_{φ(φ(φ(φ(0,ω),0),0),0)}(n)

n,{0,0},, = n,0,,{0,,~{0,,}~} = f_{φ(Γ_0,0)}(n)

n,{0,0},,0 = Γ_0+1

n,{0,0},,{0,0},, = Γ_0*2

n,0,{0,0},, = Γ_0^2

n,{{0,0},,0} = f_{φ(1,Γ_0+1)}(n)

n,0,,{{0,0},,0} = f_{φ(φ(0,ω),Γ_0+1)}(n)

n,0,,{0,,{{0,0},,0}} = f_{φ(φ(φ(0,ω),0),Γ_0+1)}(n)

n,{0,0,0},, = n,0,,{~0,,{{0,0},,0}~} = φ(Γ_0,1)

n,0,,{{0,0,0},,} = f_{φ(φ(Γ_0,1),0)}(n)

n,0,,{0,,{{0,0,0},,}} = f_{φ(φ(Γ_0,1),0)}(n)

n,{0,0,0,0},, = Γ_1

n,{0,0,0,0,0},, = Γ_2

n,{0,0,0,0,0,0},, = Γ_3

n,{1},, = Γ_ω

n,{{0,0},,},, = Γ_Γ_0

n,{{{0,0},,},,},, = Γ_Γ_Γ_0

n,0,,, = n,{{~{0,0}~,,},,},,

n,0,,,, = n,{{~{0,0}~,,,},,,},,,

n,[0] = n,0,,...,, n ,s φ(1,1,0)

n,[0],XY

n,0,[0] = n,[0],~

n,[0],, = n,[0]~ φ(1,1,1)

n,[0],0,, = n,[0],,{[0],,~{[0],,}~}

n,0,[0],, = n,[0],~,,

n,[0],,, = n,{{~[0],0}~,,},,},, = φ(1,1,2)

n,[0],,,, = n,{{~[0],0}~,,,},,,},,, = φ(1,1,3)

n,[0,0] = n,[0],,...,, = φ(1,1,ω)

n,[{0}] = φ(1,1,φ(2,0))

n,[[0]] = φ(1,1,φ(1,1,0))

n,[0-0] = φ(1,2,0)

n,[0,0-0] = n,[0-~[0-0]~] = φ(1,3,0)

n,[[0],,-0] = φ(1,φ(1,1,1),0)

n,[[[0],,-0]-0] = φ(1,φ(1,φ(1,1,1),0),0)

n,[0-0-0] = φ(2,0,0)

n,[0-0-0,0] = φ(3,0,0)

n,[0-0-0,,,] = φ(φ(1,0,1),0,0)

n,[0-0-[0-0-0,,,]] = φ(φ(φ(1,0,1),0,0),0,0)

n,[0-0-[0-0-[0-0-[0-0-0,,,]]]] = φ(φ(φ(φ(1,0,1),0,0),0,0),0,0)

n,[0-0,0-0] = n,[0-0-[0-0-~[0-0-0,,,]~]]

Send:

5,[0-0,0-0]

For f_φ(1,0,0,0)(5)

Define:

nXY

Where X and Y are strings:

,a,b,c,...

Of finite elements, possibly empty.

n, = n*(2^n)

The bottom case (it's this instead of n+1 so that the new base case produces numbers as high as the old one)

nXY,0 = aXY bXY ... oXY nXY with n spaces

Where o is nXY and a would be bXY, etc.

Define:

X = *,Z

(Z is the rightmost element in X)

Define:

Y = A,*,z

Where:

Z=>z

In other words, Z is the rightmost element in X that is equal or higher than z.

nXY = nXyy...yy for n+1 ys (n ys suffice but number would be lower than old notation)

n,~ = n,n,...,n,n with n ,s

Where:

Y = y

A,*,z = a,*,z

(A is decreased to a)

Decreasing rule:

A = a

0 = ()

n = 0,~1,2,3...n-2,n-1

And that's it.

Example 1:

4,0,1,2,3

z=3

There's no element equal or higher than z, so X is empty.

A=0

4,0,1,2,3 = 4(,1,2,3)

Make 4 copies:

4,0,1,2,3=4,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3

Example 2:

4,3,2,1,0

z=0

4,3,2,1,0 = ((((4,3,2,1),3,2,1),3,2,1),3,2,1),3,2,1

Example 3:

4,3,2,1

z=1

2>z

A=1

X=,3,2

Y=,1

a=0,~

4,3,2,1 = 4,3,2(,0,0,0,0)

Make n copies:

4,3,2,1 = 4,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0

Example 4:

4,0,1,2,3,2,1,0

z=0

4,0,1,2,3,2,1 = ((((4,0,1,2,3,2,1),0,1,2,3,2,1),0,1,2,3,2,1),0,1,2,3,2,1),0,1,2,3,2,1

Example 5:

4,0,1,2,3,2,1

z=1

2>z

A=1

X=,0,1,2,3,2

Y=,1

a=0,~

4,0,1,2,3,2,1 = 4,0,1,2,3,2(,0,0,0,0)

Make n copies:

4,0,1,2,3,2,1 = 4,0,1,2,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0

Example 6:

4,3,2,1,0,1,2,3

z=3

3=z

A=2

X=,3

Y=,2,1,0,1,2,3

a=0,~1

4,3,2,1,0,1,2,3 = 4,3(,0,0,0,0,1,1,0,1,2,3)

Make n copies:

4,3,2,1,0,1,2,3 = 4,3,0,0,0,0,1,1,0,1,2,3,0,0,0,0,1,1,0,1,2,3,0,0,0,0,1,1,0,1,2,3

,0,0,0,0,1,1,0,1,2,3,0,0,0,0,1,1,0,1,2,3

n,n = f_{φ(1,0)}(n)

And now, for an entirely different extension:

n,{0} = n,n

n,{0},0 = a,{0} b,{0} ... o,{0} n,{0} with n spaces

n,{0},0,0 = a,{0},0 b,{0},0 ... o,{0},0 n,{0},0 with n spaces

n,{0},XY

n,0,{0} = n,{0},~

n,{0,0} = n,n+1,{0} = f_{φ(0,φ(1,0)+1)}(n)

n,{0,0,0} = n,n+1,{0},{0,0} = f_{φ(0,φ(0,φ(1,0)+1))}(n)

n,{{0}} = n,{n+1} = f_{φ(1,1)}(n)

n,{{{0}}} = n,{{n+1}} = f_{φ(1,φ(1,0))}(n)

n,{{{{0}}}} = n,{{{n+1}}} = f_{φ(1,φ(1,φ(1,0)))}(n)

n,0~0 = n,{~{0}~} = f_{φ(2,0)}(n)

n,0~0,0 = n,{n+1} = f_{φ(2,0)+1}(n)

n,{0~0,0} = f_{φ(1,φ(2,0)+1)}(n)

n,{{0~0,0}} = f_{φ(1,φ(1,φ(2,0)+1))}(n)

n,0,0~0 = n,{~{0~0,0}~} = f_{φ(2,1)}(n)

n,{0~0,0}~0 = f_{φ(2,φ(2,0)+1)}(n)

n,{{0~0,0}}~0 = f_{φ(2,φ(2,φ(2,0)+1)}(n)

n,0~0~0 = n,{~{0~0,0}~}~0 f_{φ(3,0)}(n)

n,0,, = n,0~ = f_{φ(φ(0,ω),0)}(n)

n,0,,{0,,} = n,0~ = f_{φ(φ(φ(0,ω),0),0)}(n)

n,0,,{0,,{0,,}} = n,0~ = f_{φ(φ(φ(φ(0,ω),0),0),0)}(n)

n,{0,0},, = n,0,,{0,,~{0,,}~} = f_{φ(Γ_0,0)}(n)

n,{0,0},,0 = Γ_0+1

n,{0,0},,{0,0},, = Γ_0*2

n,0,{0,0},, = Γ_0^2

n,{{0,0},,0} = f_{φ(1,Γ_0+1)}(n)

n,0,,{{0,0},,0} = f_{φ(φ(0,ω),Γ_0+1)}(n)

n,0,,{0,,{{0,0},,0}} = f_{φ(φ(φ(0,ω),0),Γ_0+1)}(n)

n,{0,0,0},, = n,0,,{~0,,{{0,0},,0}~} = φ(Γ_0,1)

n,0,,{{0,0,0},,} = f_{φ(φ(Γ_0,1),0)}(n)

n,0,,{0,,{{0,0,0},,}} = f_{φ(φ(Γ_0,1),0)}(n)

n,{0,0,0,0},, = Γ_1

n,{0,0,0,0,0},, = Γ_2

n,{0,0,0,0,0,0},, = Γ_3

n,{1},, = Γ_ω

n,{{0,0},,},, = Γ_Γ_0

n,{{{0,0},,},,},, = Γ_Γ_Γ_0

n,0,,, = n,{{~{0,0}~,,},,},,

n,0,,,, = n,{{~{0,0}~,,,},,,},,,

n,[0] = n,0,,...,, n ,s φ(1,1,0)

n,[0],XY

n,0,[0] = n,[0],~

n,[0],, = n,[0]~ φ(1,1,1)

n,[0],0,, = n,[0],,{[0],,~{[0],,}~}

n,0,[0],, = n,[0],~,,

n,[0],,, = n,{{~[0],0}~,,},,},, = φ(1,1,2)

n,[0],,,, = n,{{~[0],0}~,,,},,,},,, = φ(1,1,3)

n,[0,0] = n,[0],,...,, = φ(1,1,ω)

n,[{0}] = φ(1,1,φ(2,0))

n,[[0]] = φ(1,1,φ(1,1,0))

n,[0-0] = φ(1,2,0)

n,[0,0-0] = n,[0-~[0-0]~] = φ(1,3,0)

n,[[0],,-0] = φ(1,φ(1,1,1),0)

n,[[[0],,-0]-0] = φ(1,φ(1,φ(1,1,1),0),0)

n,[0-0-0] = φ(2,0,0)

n,[0-0-0,0] = φ(3,0,0)

n,[0-0-0,,,] = φ(φ(1,0,1),0,0)

n,[0-0-[0-0-0,,,]] = φ(φ(φ(1,0,1),0,0),0,0)

n,[0-0-[0-0-[0-0-[0-0-0,,,]]]] = φ(φ(φ(φ(1,0,1),0,0),0,0),0,0)

n,[0-0,0-0] = n,[0-0-[0-0-~[0-0-0,,,]~]]

Send:

5,[0-0,0-0]

For f_φ(1,0,0,0)(5)

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

Okay, sorry, disregard that. The ,, ,,, ,,...,, and ~ extensions are garbage because they grow like ω

So, the problem with my notation is my first extension is inherently ambiguous.

We have:

,[0] = ,n

Giving φ(1,0)

Then whatever is on that box can have:

,[X],[X] = δ*2

,[X],[X],[X] = δ*3...

Up to:

0,[X] = ,[X],~ = δ*ω

Now, to reach δ^2 we need:

,[X],[X] = n,[X] = δ^2

But ,[X],[X] already stands for something else, so my notation falls apart.

What I'm going to do is use the {} soft boxes, to make them hold δ^X.

nXY rules from this post apply.

n,[0] = n,n = f_φ(1,0)

n,[0],[0] = n,[0],n = f_φ(1,0)*2

n,0,[0] = n,[0],~ = f_φ(1,0)*ω

n,n,[0] = nXY[0] = f_φ(1,0)^2

New:

n,{0},[0] = n,n,[0] = f_φ(1,0)^2

n,{0},[0],{0},[0] = n,n,[0] = f_{φ(1,0)^2}*2

n,0,{0},[0] = n,{0},[0],~~ = f_{φ(1,0)^2}*ω

n,{0},{0},[0] = n,n,{0},[0] = f_φ(1,0)^3

n,{0,0},[0] = n,{0},~[0] = f_φ(1,0)^ω

n,{{0}},[0] = n,{n},[0] = f_ω^{φ(1,0)+1}

n,{{{0}}},[0] = n,{{n}},[0] = f_ω^ω^{φ(1,0)+1}

n,[0,0] = n,{~{0}~},[0] = f_φ(1,1)

n,[[0]] = n,{~{0}~},[0] = f_φ(1,φ(1,0))

n,[[[0]]] = n,{~{0}~},[0] = f_φ(1,φ(1,φ(1,0)))

n,[0-0] = f_φ(2,0)

n,[0-[0-0]] = f_φ(2,φ(2,0))

n,[0-[0-[0-0]]] = f_φ(2,φ(2,φ(2,0)))

n,[0,0-0] = n,[0-~[0-0]~] = f_φ(3,0)

n,[0,0,0-0] = n,[0,0-~[0,0-0]~] = f_φ(4,0)

n,[1-0] = n,[0,~-0] = f_φ(ω,0)

n,[[1-0]-0] = n,[[0,~-0]-0] = f_φ(φ(ω,0),0)

n,[0-0-0] = n,[[0,~-0]-0] = f_φ(1,0,0)

n,[0-0-0],0 = f_φ(1,0,0)+1

n,[[0-0-0],0]] = f_φ(1,φ(1,0,0)+1)

n,[0-[0-0-0],0]] = f_φ(2,φ(1,0,0)+1)

n,[[0-0-0],0]-0] = f_φ(φ(ω,0),φ(1,0,0)+1)

n,[[[0-0-0],0]-0]-0] = f_φ(φ(φ(ω,0),0),φ(1,0,0)+1)

n,[0-0-0,0] = [~[0-0-0],0]~-0] = f_φ(1,0,1)

n,[0-0-0,0,0] = [~[0-0-0,0],0]~-0] = f_φ(1,0,2)

n,[0-0-1] = [0-0-0,~] = f_φ(1,0,ω)

n,[0-0-[0]] = n,[0-0-n] = f_φ(1,0,φ(1,0))

n,[0-0-[0-0-0,0]] = n,[0-0-[~[0-0-0],0]~-0]] = f_φ(1,0,φ(1,0,1))

n,[0-0-[0-0-[0-0-0,0]]] = n,[0-0-[~[0-0-0],0]~-0]] = f_φ(1,0,f_φ(1,0,φ(1,0,1)))

n,[0-0,0-0] = n,[0-0-~[0-0-0,0]~] = f_φ(1,1,0)

n,[0-0,0-0],0 = f_φ(1,1,0)+1

n,[0-0-[0-0,0-0],0] = f_φ(1,0,φ(1,1,0)+1)

n,[0-0-[0-0-[0-0,0-0],0]] = f_φ(1,0,φ(1,0,φ(1,1,0)+1)

n,[0-0,0-0,0] = n,[0-0-~[0-0,0-0],0]~] = f_φ(1,1,1)

n,[0-0,0-0,0,0] = n,[0-0,0-~[0-0,0-0,0],0]~] = f_φ(1,1,2)

n,[0-0,0-1] = n,[0-0,0-0,~] = f_φ(1,1,ω)

n,[0-0,0-[n]] = n,[0-0,0-n] = f_φ(1,1,φ(1,0))

n,[0-0,0-[0-0,0-0]] = f_φ(1,1,φ(1,1,0))

n,[0-0,0-[0-0,0-[0-0,0-0]]] = f_φ(1,1,φ(1,1,φ(1,1,0)))

n,[0-0,0,0-0] = f_φ(1,2,0)

n,[0-1-0] = n,[0-n-0] = f_φ(1,ω,0)

n,[0-[0]-0] = n,[0-n-0] = f_φ(1,φ(1,0),0)

n,[0-[0-0]-0] = n,[0-n-0] = f_φ(1,φ(2,0),0)

n,[0-[0-0-0]-0] = n,[0-[[0,~-0]-0]-0] = f_φ(1,φ(1,0,0),0)

n,[0-[0-[0-0-0]-0]-0] = n,[0-[0-[[0,~-0]-0]-0]-0] = f_φ(1,φ(1,φ(1,0,0),0),0)

n,[0,0-0-0] = n,[0-~[0-0-0]~-0] = f_φ(2,0,0)

Send:

3,[0,0-0-0] for f_φ(2,0,0)(3)

Incongruity-free, at last.

So, the problem with my notation is my first extension is inherently ambiguous.

We have:

,[0] = ,n

Giving φ(1,0)

Then whatever is on that box can have:

,[X],[X] = δ*2

,[X],[X],[X] = δ*3...

Up to:

0,[X] = ,[X],~ = δ*ω

Now, to reach δ^2 we need:

,[X],[X] = n,[X] = δ^2

But ,[X],[X] already stands for something else, so my notation falls apart.

What I'm going to do is use the {} soft boxes, to make them hold δ^X.

nXY rules from this post apply.

n,[0] = n,n = f_φ(1,0)

n,[0],[0] = n,[0],n = f_φ(1,0)*2

n,0,[0] = n,[0],~ = f_φ(1,0)*ω

n,n,[0] = nXY[0] = f_φ(1,0)^2

New:

n,{0},[0] = n,n,[0] = f_φ(1,0)^2

n,{0},[0],{0},[0] = n,n,[0] = f_{φ(1,0)^2}*2

n,0,{0},[0] = n,{0},[0],~~ = f_{φ(1,0)^2}*ω

n,{0},{0},[0] = n,n,{0},[0] = f_φ(1,0)^3

n,{0,0},[0] = n,{0},~[0] = f_φ(1,0)^ω

n,{{0}},[0] = n,{n},[0] = f_ω^{φ(1,0)+1}

n,{{{0}}},[0] = n,{{n}},[0] = f_ω^ω^{φ(1,0)+1}

n,[0,0] = n,{~{0}~},[0] = f_φ(1,1)

n,[[0]] = n,{~{0}~},[0] = f_φ(1,φ(1,0))

n,[[[0]]] = n,{~{0}~},[0] = f_φ(1,φ(1,φ(1,0)))

n,[0-0] = f_φ(2,0)

n,[0-[0-0]] = f_φ(2,φ(2,0))

n,[0-[0-[0-0]]] = f_φ(2,φ(2,φ(2,0)))

n,[0,0-0] = n,[0-~[0-0]~] = f_φ(3,0)

n,[0,0,0-0] = n,[0,0-~[0,0-0]~] = f_φ(4,0)

n,[1-0] = n,[0,~-0] = f_φ(ω,0)

n,[[1-0]-0] = n,[[0,~-0]-0] = f_φ(φ(ω,0),0)

n,[0-0-0] = n,[[0,~-0]-0] = f_φ(1,0,0)

n,[0-0-0],0 = f_φ(1,0,0)+1

n,[[0-0-0],0]] = f_φ(1,φ(1,0,0)+1)

n,[0-[0-0-0],0]] = f_φ(2,φ(1,0,0)+1)

n,[[0-0-0],0]-0] = f_φ(φ(ω,0),φ(1,0,0)+1)

n,[[[0-0-0],0]-0]-0] = f_φ(φ(φ(ω,0),0),φ(1,0,0)+1)

n,[0-0-0,0] = [~[0-0-0],0]~-0] = f_φ(1,0,1)

n,[0-0-0,0,0] = [~[0-0-0,0],0]~-0] = f_φ(1,0,2)

n,[0-0-1] = [0-0-0,~] = f_φ(1,0,ω)

n,[0-0-[0]] = n,[0-0-n] = f_φ(1,0,φ(1,0))

n,[0-0-[0-0-0,0]] = n,[0-0-[~[0-0-0],0]~-0]] = f_φ(1,0,φ(1,0,1))

n,[0-0-[0-0-[0-0-0,0]]] = n,[0-0-[~[0-0-0],0]~-0]] = f_φ(1,0,f_φ(1,0,φ(1,0,1)))

n,[0-0,0-0] = n,[0-0-~[0-0-0,0]~] = f_φ(1,1,0)

n,[0-0,0-0],0 = f_φ(1,1,0)+1

n,[0-0-[0-0,0-0],0] = f_φ(1,0,φ(1,1,0)+1)

n,[0-0-[0-0-[0-0,0-0],0]] = f_φ(1,0,φ(1,0,φ(1,1,0)+1)

n,[0-0,0-0,0] = n,[0-0-~[0-0,0-0],0]~] = f_φ(1,1,1)

n,[0-0,0-0,0,0] = n,[0-0,0-~[0-0,0-0,0],0]~] = f_φ(1,1,2)

n,[0-0,0-1] = n,[0-0,0-0,~] = f_φ(1,1,ω)

n,[0-0,0-[n]] = n,[0-0,0-n] = f_φ(1,1,φ(1,0))

n,[0-0,0-[0-0,0-0]] = f_φ(1,1,φ(1,1,0))

n,[0-0,0-[0-0,0-[0-0,0-0]]] = f_φ(1,1,φ(1,1,φ(1,1,0)))

n,[0-0,0,0-0] = f_φ(1,2,0)

n,[0-1-0] = n,[0-n-0] = f_φ(1,ω,0)

n,[0-[0]-0] = n,[0-n-0] = f_φ(1,φ(1,0),0)

n,[0-[0-0]-0] = n,[0-n-0] = f_φ(1,φ(2,0),0)

n,[0-[0-0-0]-0] = n,[0-[[0,~-0]-0]-0] = f_φ(1,φ(1,0,0),0)

n,[0-[0-[0-0-0]-0]-0] = n,[0-[0-[[0,~-0]-0]-0]-0] = f_φ(1,φ(1,φ(1,0,0),0),0)

n,[0,0-0-0] = n,[0-~[0-0-0]~-0] = f_φ(2,0,0)

Send:

3,[0,0-0-0] for f_φ(2,0,0)(3)

Incongruity-free, at last.

### Re: Your number is, in fact, not bigger!

Thats sort of the reason i use the ¿? to englobe the operator with all the inner separators. If i allow ¡! to touch the "argument", the notation falls apart.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

I've been thinking about it, probably once my notation runs out (I made some investigations, if I make n[n] = n,[n-~] it seems to have about the same growth of the TREE function...) I'll introduce separating commas as follows:

,,0,,X,,0,,

=

,X,

I.e. ,,0,, is like a comma separator.

Then I can make my entire notation fit on ,,X,,

And ,,0,,X = ,,X,,X,,X,,X,,X,,... (for an even number of elements)

Taking advantage of the ,,0,,X,,0,,s working in pairs (so they can't ever be odd, so if you find an odd number of commas it means you should make copies of X which may include any number of ,,0,,s itself)

And:

,,,0,,,X,,,0,,, = ,,X,,X

So:

n,, = n,,...,,n

Could probably reach 𝛝(𝛀^𝛀)(n) or something.

,,0,,X,,0,,

=

,X,

I.e. ,,0,, is like a comma separator.

Then I can make my entire notation fit on ,,X,,

And ,,0,,X = ,,X,,X,,X,,X,,X,,... (for an even number of elements)

Taking advantage of the ,,0,,X,,0,,s working in pairs (so they can't ever be odd, so if you find an odd number of commas it means you should make copies of X which may include any number of ,,0,,s itself)

And:

,,,0,,,X,,,0,,, = ,,X,,X

So:

n,, = n,,...,,n

Could probably reach 𝛝(𝛀^𝛀)(n) or something.

### Re: Your number is, in fact, not bigger!

if n,, = n,,...,,n wouldnt that eventually reduce down to another n,,?

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

To some pair n,,n,,X,,n,,

Basically, I could use <>s instead of ,s and do it like this:

This would be like an extension of the base separators.

{X}

[X]

<0<X>0>

<0,0<X>0,0>

<0,0,0<X>0,0,0>

<0,0,0,0<X>0,0,0,0>

<{X}<X>{X}>

<[X]<X>[X]>

<<X><X><X>>

<<<X>><X><<X>>>

<<<<X>>><X><<<X>>>>

<<X<<X>>X>>

...

But with commas...

Basically, I could use <>s instead of ,s and do it like this:

<0<X>o>

=

,X,

I.e. <0< is like a comma separator.

Then I can make my entire notation fit on <X<

And <0>X = <X<X>X>X<X<... (for an even number of elements)

Taking advantage of the <0<X>0>s working in pairs (so they can't ever be odd, so if you find an odd number of commas it means you should make copies of X which may include any number of <0<s itself)

And:

<<0<<X>>0>> = <X>X

So:

n,, = n<<...>>n

Could probably reach 𝛝(𝛀^𝛀)(n) or something.

This would be like an extension of the base separators.

{X}

[X]

<0<X>0>

<0,0<X>0,0>

<0,0,0<X>0,0,0>

<0,0,0,0<X>0,0,0,0>

<{X}<X>{X}>

<[X]<X>[X]>

<<X><X><X>>

<<<X>><X><<X>>>

<<<<X>>><X><<<X>>>>

<<X<<X>>X>>

...

But with commas...

### Re: Your number is, in fact, not bigger!

"To some pair n,,n,,X,,n,,"

This is what i mean, the red part would break again into n,,...,,n

even if it reduces to n,,n,,X,,n

wouldnt that eventually reach an open ended n,, at some point?

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

No, n,, breaks into n,,...,,n only if there's an odd number of comma pairs, otherwise, you find the rightmost ,,n,,X,,n,, and decrease X, and once you hit ,,n,,0,,n,, you decrease ,,X,,0,,X,, (both X decrease simultaneously to the same value, so ,,n,,Y,,n,, can hold any value less than X because you know those commas on the inside aren't paired with the ones on the outside.)

But anyway, this will be a late expansion...

Where is WarDaft? Who am I fighting with? Do I just keep going by myself?

n,[0,0,0-0-0] = n,[0,0-~[0,0-0-0]~-0] = f_φ(3,0,0)

Send:

3,[0,0,0-0-0] for f_φ(3,0,0)(3)

But anyway, this will be a late expansion...

Where is WarDaft? Who am I fighting with? Do I just keep going by myself?

n,[0,0,0-0-0] = n,[0,0-~[0,0-0-0]~-0] = f_φ(3,0,0)

Send:

3,[0,0,0-0-0] for f_φ(3,0,0)(3)

### Re: Your number is, in fact, not bigger!

You stand a champion until someone challenges or beats you

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

So please challenge or beat me. How's your notation doing? I'd like to compare ordinal growth with you (to go as far as I did I had to use the principle of induction, but I should be able to represent any ordinal that you'd reach, it seems you stopped at fφ(100,100)(100).)

fφ(100,100)(100) in my notation:

100,[100-100]

fφ(100,100)(100) in my notation:

100,[100-100]

### Re: Your number is, in fact, not bigger!

My notation "cascades" down to all the previous processes at each step. while also adding a layer of n self recursions. so to go side by side you would need to go to your n+1th expansion (since your notation is much more tightly close to the actual fgh)

For example

i pair these for simplicity

¿0¡1!0?4 > f

I would get there if ¿0¡1!0?4 reduced to ¿0¡0!0¡0!0¡0!0¡0!0?4

But actually the first reduction brings me to

¿4,4,4,4¡0!4,4,4,4¡0!4,4,4,4¡0!4,4,4,4¡0!4,4,4,4?

Increasing the left most number is multiplying by whatever ordinal the increase would have reached so

¿10¡0!0¡0!0¡0!0¡0!0?4 > f{

¿4,4,4,4¡0!0¡0!0¡0!0¡0!0?4 > f{

Filling the other 0's would bring a few more remainders but ignoring that you can see a a closer comparison for

¿0¡1!0?n is f

¿0¡2!0?4 the first reduction looks like this

This cascading continues to happen in the φ(m,n) to φ(m,n+1) and the φ(m,n) to φ(m+1,n) steps, so to beat my ¿0<0>0?100 you would have to beat at least φ(102,100)100 to be certain

For example

i pair these for simplicity

¿0¡1!0?4 > f

_{ω^ω^ω}(4) = f_{ω^ω^4}(4)I would get there if ¿0¡1!0?4 reduced to ¿0¡0!0¡0!0¡0!0¡0!0?4

But actually the first reduction brings me to

¿4,4,4,4¡0!4,4,4,4¡0!4,4,4,4¡0!4,4,4,4¡0!4,4,4,4?

^{4}4Increasing the left most number is multiplying by whatever ordinal the increase would have reached so

¿10¡0!0¡0!0¡0!0¡0!0?4 > f{

_{ω^ω^4}*{10}}(4)¿4,4,4,4¡0!0¡0!0¡0!0¡0!0?4 > f{

_{ω^ω^4}*{ω^ω}}(4) = f_{ω^ω^5}(4)Filling the other 0's would bring a few more remainders but ignoring that you can see a a closer comparison for

¿0¡1!0?n is f

_{ω^ω^n+1}+1(n) which completely obliterates f_{ω^ω^ω}(n) = f_{ω^ω^n}(n)¿0¡2!0?4 the first reduction looks like this

**Spoiler:**

This cascading continues to happen in the φ(m,n) to φ(m,n+1) and the φ(m,n) to φ(m+1,n) steps, so to beat my ¿0<0>0?100 you would have to beat at least φ(102,100)100 to be certain

Last edited by Daggoth on Sun Feb 15, 2015 9:54 pm UTC, edited 1 time in total.

### Re: Your number is, in fact, not bigger!

The main reason for that "feat" of mine is not actually to be annoying. It's to easily escape the fixed-point traps while ascending the φ steps

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

f{ω^ω^4}*{ω^ω} is not f{ω^ω^5}, it's f{ω^(ω^4+ω^2)}:

f{ω^ω^4}*{ω} = f{ω^(ω^4+1)}

f{ω^ω^4}*{ω2} = f{ω^(ω^4+2)}

f{ω^ω^4}*{ω^2} = f{ω^(ω^4+ω)}

f{ω^ω^4}*{ω^ω} = f{ω^(ω^4+ω^2)}

You need to reach f{ω^(ω^4+ω^4)} to reach f{ω^((ω^4)2)}, and then f{ω^((ω^4)ω)} = f{ω^ω^5}

So, all your cascading is doing pretty much doing nothing and one would need to reach φ(100,100)102 to pass it for sure.

So I'll be sending:

103,[100-100]

To make sure.

f{ω^ω^4}*{ω} = f{ω^(ω^4+1)}

f{ω^ω^4}*{ω2} = f{ω^(ω^4+2)}

f{ω^ω^4}*{ω^2} = f{ω^(ω^4+ω)}

f{ω^ω^4}*{ω^ω} = f{ω^(ω^4+ω^2)}

You need to reach f{ω^(ω^4+ω^4)} to reach f{ω^((ω^4)2)}, and then f{ω^((ω^4)ω)} = f{ω^ω^5}

So, all your cascading is doing pretty much doing nothing and one would need to reach φ(100,100)102 to pass it for sure.

So I'll be sending:

103,[100-100]

To make sure.

### Re: Your number is, in fact, not bigger!

Uh, no, sorry, I'm afraid that's not right either.

{ω^ω^4}*{ω} = {ω^(ω^4+1)} yes

{ω^ω^4}*{ω2} = {ω^(ω^4+2)} no, it's {ω^ω^4}*{ω2} = {ω^(ω^4 + 1)}*2

{ω^ω^4}*{ω^2} = {ω^(ω^4+ω)} no, it's {ω^ω^4}*{ω^2} = {ω^(ω^4 + 2)}

{ω^ω^4}*{ω^ω} = {ω^(ω^4+ω^2)} no, it's {ω^ω^4}*{ω^ω} = {ω^(ω^4+ω)}

In general, ω

{ω^ω^4}*{ω} = {ω^(ω^4+1)} yes

{ω^ω^4}*{ω2} = {ω^(ω^4+2)} no, it's {ω^ω^4}*{ω2} = {ω^(ω^4 + 1)}*2

{ω^ω^4}*{ω^2} = {ω^(ω^4+ω)} no, it's {ω^ω^4}*{ω^2} = {ω^(ω^4 + 2)}

{ω^ω^4}*{ω^ω} = {ω^(ω^4+ω^2)} no, it's {ω^ω^4}*{ω^ω} = {ω^(ω^4+ω)}

In general, ω

^{a}*ω^{b}= ω^{a + b}, exactly like exponent laws in algebra.All Shadow priest spells that deal Fire damage now appear green.

Big freaky cereal boxes of death.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

Oh, thanks WarDaft - Are you planning an extension to your notation in the shadows?

That's why I ended getting rid of rabbit holes of my number, by the end, it seems one ends "tightly close to the actual fgh" (in Daggoth's words) no matter what one does...

For instance, I believe I could pass Daggoth's cascades with this:

Define:

[0] = {n,n}

I.e.

Old notation:

5,[0] = 5,5

New notation:

5,[0] = 5,{5,5}

The former uncollapses to:

5,0,0,0,0,0,0,1,2,3,4

The latter to:

5,0,0,... n ,s...,0,0,1,2,3...n-2,n-1,n

Where n is 5,0,0,0,0,0,0,1,2,3,4

Which produces much larger numbers initially, but ends being an offset and I end at the same ordinal I do with just 5,0,0,0,0,0,0,1,2,3,4...

That's why I ended getting rid of rabbit holes of my number, by the end, it seems one ends "tightly close to the actual fgh" (in Daggoth's words) no matter what one does...

For instance, I believe I could pass Daggoth's cascades with this:

Define:

[0] = {n,n}

I.e.

Old notation:

5,[0] = 5,5

New notation:

5,[0] = 5,{5,5}

The former uncollapses to:

5,0,0,0,0,0,0,1,2,3,4

The latter to:

5,0,0,... n ,s...,0,0,1,2,3...n-2,n-1,n

Where n is 5,0,0,0,0,0,0,1,2,3,4

Which produces much larger numbers initially, but ends being an offset and I end at the same ordinal I do with just 5,0,0,0,0,0,0,1,2,3,4...

### Re: Your number is, in fact, not bigger!

That's how ordinals work. Like, with my system, literally all of the size right now is coming from the colons, literally nothing else is doing anything anymore, and could be discarded.

Which is exactly what I am doing. But all shadowy like.

Which is exactly what I am doing. But all shadowy like.

All Shadow priest spells that deal Fire damage now appear green.

Big freaky cereal boxes of death.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

WarDaft wrote:That's how ordinals work. Like, with my system, literally all of the size right now is coming from the colons, literally nothing else is doing anything anymore, and could be discarded.

Which is exactly what I am doing. But all shadowy like.

Oh yeah? What can your colons do AGAINST THIS??

n,[0-0-0-0] = n,[~[0-0,0-0,0]~-0,0-0,0] = f_φ(1,0,0,0)(n)

n,[0-0-0-0,0] = n,[~[0-0-0-0]~-0,0-0,0] = f_φ(1,0,0,1)(n)

n,[0-0-0,0-0] = n,[0-0-0-~[0-0-0-0,0]~] = f_φ(1,0,1,0)(n)

n,[0-0,0-0-0] = n,[0-0-~[0-0-0,0-0]~-0] = f_φ(1,1,0,0)(n)

n,[0,0-0-0-0] = n,[0-~[0-0,0-0-0]~-0-0] = f_φ(2,0,0,0)(n)

n,[0-0-0-0-0] = n,[~[0-0,0-0,0-0,0]~-0,0-0,0-0,0] = f_φ(1,0,0,0,0)(n)

n,[0-0-0-0-0,0] = n,[~[0-0-0-0-0]~-0,0-0,0-0,0] = f_φ(1,0,0,0,1)(n)

n,[0-0-0-0,0-0] = n,[0-0-0-0-~[0-0-0-0,0]~] = f_φ(1,0,0,1,0)(n)

n,[0-0-0,0-0-0] = n,[0-0-0-~[0-0-0-0,0-0]~-0] = f_φ(1,0,1,0,0)(n)

n,[0-0,0-0-0-0] = n,[0-0-~[0-0-0,0-0-0]~-0-0] = f_φ(1,1,0,0,0)(n)

n,[0,0-0-0-0-0] = n,[0-~[0-0,0-0-0-0]~-0-0-0] = f_φ(2,0,0,0,0)(n)

n,[0-0-0-0-0-0] = n,[~[0-0,0-0,0-0,0-0,0]~-0,0-0,0-0,0-0,0] = f_φ(1,0,0,0,0,0)(n)

n,[0-0-0-0-0-0-0] = n,[~[0-0,0-0,0-0,0-0,0-0,0]~-0,0-0,0-0,0-0,0-0,0] = f_φ(1,0,0,0,0,0,0)(n)

n,[0-0-0-0-0-0-0-0] = n,[~[0-0,0-0,0-0,0-0,0-0,0-0,0]~-0,0-0,0-0,0-0,0-0,0-0,0] = f_φ(1,0,0,0,0,0,0,0)(n)

n,00 = n,[0-~]

Send:

5,00

For 𝛝(𝛀^𝛚)(5)

How's that for "1-upmanship"?

### Re: Your number is, in fact, not bigger!

U sure about that?

If x^1 = x

and x^4 * x = x^5

and x=w^w

where am i misapplying the math here?

If x^1 = x

and x^4 * x = x^5

and x=w^w

where am i misapplying the math here?

### Re: Your number is, in fact, not bigger!

Daggoth wrote:U sure about that?

If x^1 = x

and x^4 * x = x^5

and x=w^w

where am i misapplying the math here?

Exponentiation is not associative.

(x^x)^5 is not the same as x^(x^5)

(x^x)^5 is x^(x*5)

Also, Vytron, what ordinal is 𝛝? It's not rendering for me... I just get a box.

Typically after φ, one uses ordinal collapse to describe ordinals, where ψ((Ω^Ω^α)*β) is equivalent to φ(β,0,0...,0) where β is in the α-th place, so ψ(Ω^Ω^ω) is the supremum of φ(1), φ(1,0), φ(1,0,0), φ(1,0,0,0)....

Last edited by WarDaft on Mon Feb 16, 2015 8:45 pm UTC, edited 1 time in total.

All Shadow priest spells that deal Fire damage now appear green.

Big freaky cereal boxes of death.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

You're confusing {w^w}^4 with w^{w^4} (to Daggoth).

Ninja'd.

Aw, it looked so fancy...

It's:

Do you see any of these 5 symbols or do you see only boxes?

𝛝 𝜗 𝝑 𝞋 𝟅

What you actually wanted to know:

It's the Small Veblen Ordinal in Weiermann's ordinal notation.

Redundant

Ninja'd.

Also, Vytron, what ordinal is 𝛝? It's not rendering for me... I just get a box.

Aw, it looked so fancy...

It's:

Do you see any of these 5 symbols or do you see only boxes?

𝛝 𝜗 𝝑 𝞋 𝟅

What you actually wanted to know:

It's the Small Veblen Ordinal in Weiermann's ordinal notation.

Redundant

**Spoiler:**

### Re: Your number is, in fact, not bigger!

I see only boxes.

All Shadow priest spells that deal Fire damage now appear green.

Big freaky cereal boxes of death.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

Okay, but you saw this image alright?

### Re: Your number is, in fact, not bigger!

Yes, that comes through. I'll be posting the revised notation later today or early tomorrow, once I have drummed up a good list of example values.

All Shadow priest spells that deal Fire damage now appear green.

Big freaky cereal boxes of death.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

Will be looking forward to it

Anyway, so it has come to this, I'm going to upload the image to that ordinal to the forum so every time I want to use it I just paste the image code:

Anyway, so it has come to this, I'm going to upload the image to that ordinal to the forum so every time I want to use it I just paste the image code:

### Re: Your number is, in fact, not bigger!

Ah i see where i was wrong. But still f

_{ω^{ω4+ω}}+1(4) > f_{ω^ω4}(4) so my point about ¿0<0>0?100 stands.### Re: Your number is, in fact, not bigger!

Pretty sure Vytrons base rules don't get anywhere near epsilon_0 when he claims. I put n,n around w^w^w.

I came back to this thread and I see a lot of posting over top of each other, but not a lot of talk about what's actually happening in each step. Is anyone actually checking any of the claims made, or are you all just claiming larger ordinals without verifying the other actually reached what was claimed?

I came back to this thread and I see a lot of posting over top of each other, but not a lot of talk about what's actually happening in each step. Is anyone actually checking any of the claims made, or are you all just claiming larger ordinals without verifying the other actually reached what was claimed?

addams wrote:This forum has some very well educated people typing away in loops with Sourmilk. He is a lucky Sourmilk.

### Re: Your number is, in fact, not bigger!

Anyway, this is indeed the crossover I was waiting for to re-vamp things.

< > are the repeater operator, such that <X> means the string X repeated n times

( ) denote an array, which is to be evaluated lazily, rather than immediately.

[;] is an advanced delimiter. : and ; will not work the same, so I'm not re-using :.

Capitals represent any number of terms (including zero), lower case represent exactly one term.

{ } represent special rules for decrementing a term.

n|0 = n

n|X = n+1|X--

(0)-- = 0

(b)-- = (b--)

(X,0,0)-- where X contains no non-zero terms = <(X,>0<)>

(X,0,b,Y)-- where X contains no non-zero terms = <(X,>0<,b--,Y)>

(a,X,0,b,Y)-- where X contains no non-zero terms, and b does not contain square brackets = <(a--,X,>(a--,X,0,b,Y)<,b--,Y)>

(a,b,X)-- = <(>(a--,b,X)<,b--,X)>

Terms containing [;] are considered non-zero.

(0[;]0,X) = (<0,>X)

(a,0[;]0,X)-- where X is all zero = (<0,>(a--,0[;]0,X),X)

(a,b[;]0,X)-- = (<0,>(a--,b[;]0,X),b--[;]0,X)

(0[;]b,X)-- = <(>0<[;]b--,X)>

(a,0[;]b,X)-- = <(>(a--,0[;]b,X)<[;]b--,X)>

(a[;]b,X)-- = <(>0<[;]b--,a--[;]b,X)>

(a,b[;]c,X)-- = <(>(a--,b[;]c,X)<[;]c--,b--[;]c,X)>

Using the Hardy hierarchy.

2|0 = 2 = f{0}(1)

2|(0) = 3 = f{0}(2)

2|(((((0))))) = f{0}(6)

2|(0,0) = ((0)) = f{1}(2)

2|((0,0),0) = f{1}(f{1}(2)

2|(0,1) = f{2}(2)

2|(0,2) = f{3}(2)

2|(0,(0,0)) = f{ω}(2)

2|(0,(1,0)) = f{ω+1}(2)

2|(0,((0,0),0)) = f{ω*2}(2)

2|(0,((1,0),0)) = f{ω*2+1}(2)

2|(0,(((0,0),0),0)) = f{ω*3}(2)

2|(0,(0,1)) = f{ω^2}(2)

2|(0,((0,1),1)) = f{ω^2*2}(2)

2|(0,(0,2)) = f{ω^3}(2)

2|(0,(0,3)) = f{ω^3}(2)

2|(0,(0,(0,0))) = f{ω^ω}(2)

2|(0,(1,(0,0))) = f{ω^ω+1}(2)

2|(0,((0,(0,0)),(0,0))) = f{ω^ω*2}(2)

2|(0,(0,(1,0))) = f{ω^(ω+1)}(2)

2|(0,(0,((0,0),0))) = f{ω^(ω*2)}(2)

2|(0,(0,(((0,0),0),0))) = f{ω^(ω*3)}(2)

2|(0,(0,(0,1))) = f{ω^(ω^2)}(2)

2|(0,(1,(0,1))) = f{ω^(ω^2)+1}(2)

2|(0,(0,(1,1))) = f{ω^(ω^2+1)}(2)

2|(0,(0,((0,0),1))) = f{ω^(ω^2+ω)}(2)

2|(0,(0,((0,1),1))) = f{ω^(ω^2*2)}(2)

2|(0,(0,(0,2))) = f{ω^(ω^3)}(2)

2|(0,(0,(0,(0,0)))) = f{ω^(ω^ω)}(2)

2|(0,0,0) = f{φ(1,0)}(2) = f{ψ(0)}(2)

2|(0,(0,0,0)) = f{φ(1,0)+1}(2) = f{ψ(0)+1}(2)

2|(0,(0,(0,0,0))) = f{ω^(ψ(0)+1)}(2)

2|(0,(0,(0,(0,0,0)))) = f{ω^ω^(ψ(0)+1)}(2)

2|(1,0,0) = f{ψ(1)}(2) (ε

2|(2,0,0) = f{ψ(2)}(2)

2|((0,0,0),0,0) = f{ψ(ψ(0))}(2)

2|(0,1,0) = f{ψ(Ω)}(2)

In general 2|(a,b,c,d) = f{φ(d,c,b,a)}(2)

As such, 2|(0[;]0) is f{ψ(Ω^Ω^ω)}(2) and 2|(0[;](0[;]0)) is f{ψ(Ω^Ω^(ψ(Ω^Ω^ω)))}(2)

< > are the repeater operator, such that <X> means the string X repeated n times

( ) denote an array, which is to be evaluated lazily, rather than immediately.

[;] is an advanced delimiter. : and ; will not work the same, so I'm not re-using :.

Capitals represent any number of terms (including zero), lower case represent exactly one term.

{ } represent special rules for decrementing a term.

n|0 = n

n|X = n+1|X--

(0)-- = 0

(b)-- = (b--)

(X,0,0)-- where X contains no non-zero terms = <(X,>0<)>

(X,0,b,Y)-- where X contains no non-zero terms = <(X,>0<,b--,Y)>

(a,X,0,b,Y)-- where X contains no non-zero terms, and b does not contain square brackets = <(a--,X,>(a--,X,0,b,Y)<,b--,Y)>

(a,b,X)-- = <(>(a--,b,X)<,b--,X)>

Terms containing [;] are considered non-zero.

(0[;]0,X) = (<0,>X)

(a,0[;]0,X)-- where X is all zero = (<0,>(a--,0[;]0,X),X)

(a,b[;]0,X)-- = (<0,>(a--,b[;]0,X),b--[;]0,X)

(0[;]b,X)-- = <(>0<[;]b--,X)>

(a,0[;]b,X)-- = <(>(a--,0[;]b,X)<[;]b--,X)>

(a[;]b,X)-- = <(>0<[;]b--,a--[;]b,X)>

(a,b[;]c,X)-- = <(>(a--,b[;]c,X)<[;]c--,b--[;]c,X)>

Using the Hardy hierarchy.

2|0 = 2 = f{0}(1)

2|(0) = 3 = f{0}(2)

2|(((((0))))) = f{0}(6)

2|(0,0) = ((0)) = f{1}(2)

2|((0,0),0) = f{1}(f{1}(2)

2|(0,1) = f{2}(2)

2|(0,2) = f{3}(2)

2|(0,(0,0)) = f{ω}(2)

2|(0,(1,0)) = f{ω+1}(2)

2|(0,((0,0),0)) = f{ω*2}(2)

2|(0,((1,0),0)) = f{ω*2+1}(2)

2|(0,(((0,0),0),0)) = f{ω*3}(2)

2|(0,(0,1)) = f{ω^2}(2)

2|(0,((0,1),1)) = f{ω^2*2}(2)

2|(0,(0,2)) = f{ω^3}(2)

2|(0,(0,3)) = f{ω^3}(2)

2|(0,(0,(0,0))) = f{ω^ω}(2)

2|(0,(1,(0,0))) = f{ω^ω+1}(2)

2|(0,((0,(0,0)),(0,0))) = f{ω^ω*2}(2)

2|(0,(0,(1,0))) = f{ω^(ω+1)}(2)

2|(0,(0,((0,0),0))) = f{ω^(ω*2)}(2)

2|(0,(0,(((0,0),0),0))) = f{ω^(ω*3)}(2)

2|(0,(0,(0,1))) = f{ω^(ω^2)}(2)

2|(0,(1,(0,1))) = f{ω^(ω^2)+1}(2)

2|(0,(0,(1,1))) = f{ω^(ω^2+1)}(2)

2|(0,(0,((0,0),1))) = f{ω^(ω^2+ω)}(2)

2|(0,(0,((0,1),1))) = f{ω^(ω^2*2)}(2)

2|(0,(0,(0,2))) = f{ω^(ω^3)}(2)

2|(0,(0,(0,(0,0)))) = f{ω^(ω^ω)}(2)

2|(0,0,0) = f{φ(1,0)}(2) = f{ψ(0)}(2)

2|(0,(0,0,0)) = f{φ(1,0)+1}(2) = f{ψ(0)+1}(2)

2|(0,(0,(0,0,0))) = f{ω^(ψ(0)+1)}(2)

2|(0,(0,(0,(0,0,0)))) = f{ω^ω^(ψ(0)+1)}(2)

2|(1,0,0) = f{ψ(1)}(2) (ε

_{1}already!)2|(2,0,0) = f{ψ(2)}(2)

2|((0,0,0),0,0) = f{ψ(ψ(0))}(2)

2|(0,1,0) = f{ψ(Ω)}(2)

In general 2|(a,b,c,d) = f{φ(d,c,b,a)}(2)

As such, 2|(0[;]0) is f{ψ(Ω^Ω^ω)}(2) and 2|(0[;](0[;]0)) is f{ψ(Ω^Ω^(ψ(Ω^Ω^ω)))}(2)

At some point, I realized it was just easier to beat his claims than prove them correct or incorrect.mike-l wrote:Pretty sure Vytrons base rules don't get anywhere near epsilon_0 when he claims. I put n,n around w^w^w.

I came back to this thread and I see a lot of posting over top of each other, but not a lot of talk about what's actually happening in each step. Is anyone actually checking any of the claims made, or are you all just claiming larger ordinals without verifying the other actually reached what was claimed?

All Shadow priest spells that deal Fire damage now appear green.

Big freaky cereal boxes of death.

- Vytron
**Posts:**429**Joined:**Mon Oct 19, 2009 10:11 am UTC**Location:**The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

### Re: Your number is, in fact, not bigger!

mike-l wrote:Pretty sure Vytrons base rules don't get anywhere near epsilon_0 when he claims. I put n,n around w^w^w.

We have gone over this before, these are an equivalent rewrite of the rules that you yourself proved to reach w^^a in the following quote in the following spoiler:

**Spoiler:**

And and the n,YX rules can be mapped to these values that you yourself claimed went over f_w^w^w^w:

**Spoiler:**

Would be represented with a n,0,0,1,0,0,1,2,3.

So, prove my rewrite isn't equivalent or get in contact with your old self?

Now, we're using different ordinal notations, they're equivalent at:

f{ψ(Ω^Ω^ω)}(2) = f{(Ω^ω)}(2)

So:

2|(0[;](0[;]0)) is f{(Ω^{Ω^ω})}(2)

Now, plopping my values over the old boxes is much stronger than expected but much weaker than WarDaft so I need to go over it with a finecomb. I.e. it could be claimed that:

n,01 = [00-~] = (n+1),00

Which is silly.

So I'll go over everything I do to get there, just to show (n+1),00 is beaten on the very first inner nestings.

n,00,0 = (((n),00),00...),00 (for n+1 nestings, I'm using n+1 instead of n so it matches my other n,00 n,00...n,00 with n spaces notation)

n,00,0,0 = (((n),00,0),00,0...),00,0

n,00,0,0,0 = (((n),00,0,0),00,0,0...),00,0,0

n,00,1 = n,00,0,~

n,00,1,0 = (((n),00,1),00,1...),00,1

n,00,1,0,0 = (((n),00,1,0),00,1,0...),00,1,0

n,00,1,1 = n,00,1,0,~

n,00,0,1 = n,00,1,~

n,00,0,0,1 = n,00,0,1,~~

n,00,0,0,0,1 = n,00,0,0,1,~~~

n,00,2 = n,00,0,~1

n,00,3 = n,00,0,~1,2

n,00,[0] = n,00,n

n,00,[0],[0] = n,00,[0],n

n,00,[0],[0],[0] = n,00,[0],[0],n

n,00,0,[0] = n,00,[0],~

n,00,0,0,[0] = n,00,0,[0],~~

n,00,0,0,0,[0] = n,00,0,0,[0],~~~

n,00,1,[0] = n,00,0,~[0]

n,00,2,[0] = n,00,0,~1,[0]

n,00,3,[0] = n,00,0,~1,2,[0]

n,00,{0},[0] = n,00,n,[0]

Here's where things explode, because I can fit my entire notation on the {}s

n,00,{00,{0},[0]},[0] = n,00,{n,00,n,[0]},[0] = ψ({Ω^Ω^ω}+1)

n,00,{00,{00,{0},[0]},[0]},[0] = ψ({Ω^Ω^ω}+2)

n,00,{00,{00,{00,{0},[0]},[0]},[0]},[0] = ψ({Ω^Ω^ω}+3)

n,00,[0,0] = n,00,{00,~{00,{0},[0]}~,[0]},[0] = ψ({Ω^Ω^ω}+ω)

Entire notation in n,00,[X]

n,00,[0-0] = n,00,[~[00]~] = ψ({Ω^Ω^ω}*2)

n,00,[0-0,0] = n,00,[~[0-0]~] = ψ({Ω^Ω^ω}*3)

Entire notation in n,00,[0-X]

n,00,[0,0-0] = n,00,[0-[~[0-0]~]] = ψ({Ω^Ω^ω}^2)

n,00,00 = n,00,[0-~] = ({Ω^ω}+1)

n,00,00,00 = n,00,00,[0-~] = ({Ω^ω}+2)

n,0,00 = n,00,00,~ = ({Ω^ω}+ω)

n,{0},00 = n,n,00,~ = ({Ω^ω}+φ(1,0))

Entire notation in n,{X},00

n,[00] = n,{~{00,00}~},00 = ({Ω^ω}*2)

n,[00,0] = n,{~{00,00}~},[00] = ({Ω^ω}*3)

n,[00,0,0] = n,{~{00,00}~},[00,0] = ({Ω^ω}*4)

n,[00,1] = n,[00,0,~] = ({Ω^(ω+1)})

n,[00,{0}] = n,[00,n+1] = ({Ω^(φ(1,0))})

Entire notation in n,[00,{X}]

n,[00,{00}] = n,[00,{[0-~]}] = ({Ω^(Ω^ω)})

^Matches WarDaft.

n,[00,{[00]}] = n,[00,{{~{00,00}~},00}] = ({Ω^{(Ω^ω)}2})

Send:

5,[00,{[00]}]

For:

f{ψ(Ω^Ω^(ψ(Ω^{{Ω^ω}2})))}(5)

### Re: Your number is, in fact, not bigger!

We have been over this before, I showed you that you were wrong, I gave you rules that worked, and you copied them incorrectly into rules that have the same problem you originally had.

addams wrote:This forum has some very well educated people typing away in loops with Sourmilk. He is a lucky Sourmilk.

### Who is online

Users browsing this forum: No registered users and 16 guests