My Number is WAYYY larger [game]

[confocaloid]

TREE(4)

TREE_(TREE(3))(TREE(3))

TREE(w^^^^^w)

TREE(w)

TREE(3)

source

[ababa11e]

TREE(3)

s(3,3{1``2}2) in SAN > TREE[3]'s lower bound

[CARuler]

TREE(TREES)
TREES = TREE_TREE(3)(TREE(33))^^^3

[ababa11e]

TREE(TREES)
TREES = TREE_TREE(3)(TREE(33))^^^3

SCG(14).

[unname4798]

X(0) = 2
X(n) = w[X(n-1)]w
X[w^w](w^w)

what, that's literally infinite (assuming you meant {} instead of [] for representing an amount of up arrows)

I use [] to represent a number of up arrows.

[CARuler]

SCG(TREE(4))

[unname4798]

SCG(TREE(4))

J(0) = 3
J(n)=TREE repeated J(n-1) times (J(n-1))
J(2024{2024}2024)

[CARuler]

J(10^[10]10)

[ababa11e]

J(10^[10]10)

D5(99). Loader's number.
It beats everything here so far out of the water, and is the new largest number.
D5(99) >> SSCG(SCCG(SSCG...SSCG(13)...))) SSCG(13) long

[CARuler]

RAYO(10^[10]10)

[ababa11e]

RAYO(10^[10]10)

F7[F7[F7...repeated 10^[10]10 times...F7[100]...] using the function Fish Number 7 relies on >>> RAYO(10^[10]10)
also, wait a sec, isnt Rayo(n) uncomputable?

Okay reset: 1

[CARuler]

2

[ababa11e]

2

4

[confocaloid]

4

4^4^4 (155 digits decimal, approx. 1.34e+154)

[ababa11e]

4

4^4^4 (155 digits decimal, approx. 1.34e+154)

f(n) = n^((f(n-1))
f(5) = 5^4^3^2^1

[unname4798]

4

4^4^4 (155 digits decimal, approx. 1.34e+154)

f(n) = n^((f(n-1))
f(5) = 5^4^3^2^1

f(n) = f(n-1)!
f(0) = 3
f(4)

[ababa11e]

g(n) = F_w(g(N-1)) F_w being f omega in fgh

g(10^100)

[CARuler]

TREE(5)

[confocaloid]

There seems to be something very wrong with everything in this thread inevitably hitting into TREE. Section nineteen or something.

TREE(5)

TREE(4)

TREE_(TREE(3))(TREE(3))

TREE(w^^^^^w)

TREE(w)

TREE(3)

[...]

[ababa11e]

TREE(5)

why. there is 6 bajillion ways to write a number that didnt break the rules.

and you chose one of the few ways you could.

reset: 1
and whenever you post tree[n] or TREE[n], ill just reset

[hotdogPi]

TREE(2)

[get_Snacked]

{2,2,2,2,2} in Bowers' Exploding Array Function

I use [] to represent a number of up arrows.

still infinite

Since when does a set evaluate to a number? (asking seriously)

fixed, he uses curly braces to represent his notation because why not (i guess parentheses would look like coordinates, while brackets would look like vectors?)
EDIT: if you need someone to convert a post into FGH, quote this message

[hotdogPi]

Since when does a set evaluate to a number? (asking seriously)

[ababa11e]

{2,2,2,2,2,2... {2,2,2,2} long...,2} in BEAF

[CARuler]

{BB(10^[10]10),B(10^[10]10),...,BB(10^[10]10)} BB(10^[10]10) times in BEAF