ConwayLife.com

CARuler wrote: September 9th, 2024, 9:21 pmTREE(4)

CARuler wrote: September 11th, 2024, 9:07 amTREE_(TREE(3))(TREE(3))

CARuler wrote: September 11th, 2024, 2:59 pmTREE(w^^^^^w)

CARuler wrote: September 12th, 2024, 9:31 pmTREE(w)

CARuler wrote: September 13th, 2024, 8:28 pmTREE(3)

source

CARuler wrote: September 13th, 2024, 8:28 pmTREE(3)

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

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

CARuler wrote: September 13th, 2024, 9:36 pm TREE(TREES)
TREES = TREE_TREE(3)(TREE(33))^^^3

SCG(14).

get_Snacked wrote: September 13th, 2024, 9:08 am

unname4798 wrote: September 13th, 2024, 3:24 am 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.

SCG(TREE(4))

CARuler wrote: September 14th, 2024, 10:58 amSCG(TREE(4))

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

J(10^[10]10)

CARuler wrote: September 14th, 2024, 3:45 pmJ(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

RAYO(10^[10]10)

CARuler wrote: September 15th, 2024, 12:06 am 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

2

CARuler wrote: September 15th, 2024, 12:55 am2

4

ababa11e wrote: September 15th, 2024, 1:01 am4

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

confocaloid wrote: September 15th, 2024, 1:09 am

ababa11e wrote: September 15th, 2024, 1:01 am4

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

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

ababa11e wrote: September 15th, 2024, 1:43 am

confocaloid wrote: September 15th, 2024, 1:09 am

ababa11e wrote: September 15th, 2024, 1:01 am4

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)

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

g(10^100)

TREE(5)

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

CARuler wrote: September 15th, 2024, 9:26 amTREE(5)

confocaloid wrote: September 13th, 2024, 8:46 pm

CARuler wrote: September 9th, 2024, 9:21 pmTREE(4)

CARuler wrote: September 11th, 2024, 9:07 amTREE_(TREE(3))(TREE(3))

CARuler wrote: September 11th, 2024, 2:59 pmTREE(w^^^^^w)

CARuler wrote: September 12th, 2024, 9:31 pmTREE(w)

CARuler wrote: September 13th, 2024, 8:28 pmTREE(3)

[...]

CARuler wrote: September 15th, 2024, 9:26 amTREE(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

TREE(2)

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

unname4798 wrote: September 14th, 2024, 1:26 am I use [] to represent a number of up arrows.

still infinite

hotdogPi wrote: September 15th, 2024, 4:52 pm 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

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

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

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