Alright. Idelac, thank you for being willing to learn, and also for pointing out algot's errors.

Let me just copy-paste a post about the same thing...

"

(Note: In this, we assume that 0 does not count as a positive integer.)

In which a,b, and c must be positive integers, X is shorthand for at least 3 positive integers, and Y is shorthand for at least 1 positive integer.

DN(a) = a

DN(a,1) = DN(a+1)

DN(a,b) = DN(a+1,b-1)

DN(a,b,1) = DN(a,b)

DN(a,1,c) = DN(a)

DN(a,b,c) = DN(a,DN(a,b-1,c),c-1)

DN( X ,1) = DN( X )

DN(1, X ) = DN( X )

DN( X ,1, Y) = DN( X , Y )

DN( Y ,a,b,c) = DN( Y ,a,DN( Y , a,b-1,c),c-1)

DN(a,b,1) = a+b

DN(a,b,2) = a+a+...+a+a = a*b

DN(a,b,3) = a*a*...*a*a = a^b

DN(a,b,c) = a^^...^^b with c-2 ^'s

DN(10,10,10,x,2) < G(x)

DN(10,10,10,x,3) < G(x,x)

DN(10,10,10,10,10,2) = Very big compared to G(1000,1000)

Advice: It's not enough to have only one argument, or two, or three, your function has to be able to take any number of arguments. When I say arguments, I really mean numbers. A 2-argument function is f(a,b) = a+b. A five-argument function is f(a,b,c,d,e) = a+(b*(c^(d^^e))). A function that can take any number of arguments is f(a,b,c...) = All the inputs multiplied together. After that, you'll want to extend the function somehow. Make a second leap like going from 3 arguments to as many arguments as you want. Then, find some way to make as many of those leaps as you want. That's the first super-leap. DN( X |^a Y) was my first super-leap. Then, make a leap beyond that. For me, that was < Y ,a>. I'm currently working on the second super-leap, but I don't know where to go from there.

Okay, to clear something up Tux3, I did not rage quit this thread. During summer 2018, I drifted away from MC Forums for unrelated reasons.

I am, however, annoyed at all the people who just post meaningless salad numbers.

I am also annoyed at all the people who post numbers commonly thought of as "biggest" (TREE(3) and Rayo's number) without bothering to prove that their number is bigger than the previous number.

But aluminum is a perfectly valid material for a knife! Yes, it dulls easier, but since I specifically stabbed him instead of slashing him, the dullness doesn't matter!

Do you actually know how googolology works, or are you just spitballing? An infinite sequence of nines is just infinity, which is disallowed by rule 2. Rayo's number is not computable, which violates rule 1. BIG FOOT is also non-computable, again violating rule 1.

<8,8,8,8,8,8,8,8,8, and so on a Googleplexian times and at the very end, G(10^^^^^Googleplexian)>

Instead of just wasting bandwidth with non-computable numbers and infinities, define your own fast-growing function.

0

Alright. Idelac, thank you for being willing to learn, and also for pointing out algot's errors.

Let me just copy-paste a post about the same thing...

"

(Note: In this, we assume that 0 does not count as a positive integer.)

In which a,b, and c must be positive integers, X is shorthand for at least 3 positive integers, and Y is shorthand for at least 1 positive integer.

DN(a) = a

DN(a,1) = DN(a+1)

DN(a,b) = DN(a+1,b-1)

DN(a,b,1) = DN(a,b)

DN(a,1,c) = DN(a)

DN(a,b,c) = DN(a,DN(a,b-1,c),c-1)

DN( X ,1) = DN( X )

DN(1, X ) = DN( X )

DN( X ,1, Y) = DN( X , Y )

DN( Y ,a,b,c) = DN( Y ,a,DN( Y , a,b-1,c),c-1)

DN(a,b,1) = a+b

DN(a,b,2) = a+a+...+a+a = a*b

DN(a,b,3) = a*a*...*a*a = a^b

DN(a,b,c) = a^^...^^b with c-2 ^'s

DN(10,10,10,x,2) < G(x)

DN(10,10,10,x,3) < G(x,x)

DN(10,10,10,10,10,2) = Very big compared to G(1000,1000)

Advice: It's not enough to have only one argument, or two, or three, your function has to be able to take any number of arguments. When I say arguments, I really mean numbers. A 2-argument function is f(a,b) = a+b. A five-argument function is f(a,b,c,d,e) = a+(b*(c^(d^^e))). A function that can take any number of arguments is f(a,b,c...) = All the inputs multiplied together. After that, you'll want to extend the function somehow. Make a second leap like going from 3 arguments to as many arguments as you want. Then, find some way to make as many of those leaps as you want. That's the first super-leap. DN( X |^a Y) was my first super-leap. Then, make a leap beyond that. For me, that was < Y ,a>. I'm currently working on the second super-leap, but I don't know where to go from there.

"

/nullpost

0

Okay, to clear something up Tux3, I did not rage quit this thread. During summer 2018, I drifted away from MC Forums for unrelated reasons.

I am, however, annoyed at all the people who just post meaningless salad numbers.

I am also annoyed at all the people who post numbers commonly thought of as "biggest" (TREE(3) and Rayo's number) without bothering to prove that their number is bigger than the previous number.

(TREE(TREE(100)))^(TREE(TREE(101)))0

I destroy him emotionally by taunting him about his defeat in chess.

0

But aluminum is a perfectly valid material for a knife! Yes, it dulls easier, but since I specifically stabbed him instead of slashing him, the dullness doesn't matter!

Checkmate, This Guy!

0

I search for items.

0

I'm not asking for a franchise with its own Happy Meal toys, but a progress bar or something would be nice.

I become Nice Guy and stab the guy. Due to my powers, the mysterious anti-anti-guy force does not consider me a threat and does not activate.

0

2. I might have seen your username once or twice.

0

Tux, are you not going to mention the fact that this is a bad ripoff of Defeat the Godmodder? Kill this Guy doesn't have quite the same ring to it.

0

<8,8,8,8,8,8,8,8,8, and so on a Googleplexian times and at the very end, G(10^^^^^^Googleplexian)>

What part of "define your own fast-growing function" did you not understand?

0

I accuse Tux4 of making a low-quality ripoff of Defeat the Godmodder.

0

Do you actually know how googolology works, or are you just spitballing? An infinite sequence of nines is just infinity, which is disallowed by rule 2. Rayo's number is not computable, which violates rule 1. BIG FOOT is also non-computable, again violating rule 1.

<8,8,8,8,8,8,8,8,8, and so on a Googleplexian times and at the very end, G(10^^^^^Googleplexian)>

Instead of just wasting bandwidth with non-computable numbers and infinities, define your own fast-growing function.

1

Your bed breaks into tears and leaves, accusing you of cheating on it.

I take over the Tri-State Area.

0

It hollows out the hill. And the mountain hundreds of blocks away with that mineshaft you were going to explore.

0

Public service announcement: Be creative! Don't do salad numbers.

<8,8,8,8,8,8,8,8,8, and so on a Googleplexian times and at the very end, G(10^^^^Googleplexian)>

0

<3,3,3,3,3,3,3,3,G(10^^^10)>