Image not available

1200x799

ai-walking-robot-....jpg

๐Ÿงต Biggest number championship

Anonymous No. 16069911

Write the biggest number you can ITT. Biggest one wins. I'll go first: 10^1000

Anonymous No. 16069915

>>16069911
1+10^1000

Anonymous No. 16069917

Biggest in base 62

Anonymous No. 16069918

>>16069917
Wait, no. Biggest1 in base 62.

Anonymous No. 16069924

MMMCMXCIX

Anonymous No. 16069930

0-1

Anonymous No. 16069958

>>16069911
Tree(3)

Barkon No. 16069977

You buffoon's ladies. You can't get a unit higher than four thousand quadrillion.

Anonymous No. 16070004

>>16069911
TREE(10^googolplexplex)

Anonymous No. 16070005

>>16070004
>>16069915
>>16069917
>>16069918
>>16069924
>>16069930
>>16069958
these + 1

Anonymous No. 16070011

1 divided by 0

Image not available

800x800

1710054320386187.png

๐Ÿ—‘๏ธ Anonymous No. 16070014

>Tree

Anonymous No. 16070023

>>16069911
Tree(69!)!

Anonymous No. 16070025

(Tree(Tree(69))!)^100000000000000000000000000000000000000000000000

Anonymous No. 16070030

>>16070025
Mine is still bigger cuz u forgot first !

Anonymous No. 16070032

Let G be grahams generating function. Such that G(0) = 3 [ 4 Knuth up arrows] 3 and G(n) = 3 [G(n-1) Knuth up arrows] 3

Define function chain such that chain(f, n, c) represents n recursive calls of of f with initial value c. chain(f, 3, 0) for example is f(f(f(0)))

chain(G, G(64), 0) is my submission

Anonymous No. 16070036

>>16069911
1 / 0

Anonymous No. 16070039

>>16070011
>>16070036
That doesn't result in infinity.

Anonymous No. 16070060

Let L(n) be the largest number that can be generated with n characters of ANSI C running on a modern computer with infinite memory. Run time of the program is irrelevant so long as it always halts.

L(L(10^1000))

Anonymous No. 16070062

>>16070032
Thats not a numberr

Anonymous No. 16070066

>>16070062
Nigger you know that a function outputs a number right?

๐Ÿ—‘๏ธ Anonymous No. 16070074

googl!^googl!^googl!

Anonymous No. 16070082

(googol!^googol!^googol!^googol!)!

Anonymous No. 16070085

>>16070074
>>16070082
Freshman tier submission

Anonymous No. 16070104

>>16070060
this + 1

Image not available

7280x7080

b.jpg

Anonymous No. 16070110

>>16069911

Anonymous No. 16070111

>>16070060
This to the power of this >>16070082

Anonymous No. 16070122

99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999

Anonymous No. 16070126

>>16070122 me
>Write the biggest number you can
I'm technically right

Barkon No. 16070127

>>16070126
It's over 9000

Anonymous No. 16070165

>>16070060
This is just an evasive way of saying "the biggest possible number is the biggest possible number"

Barkon !otRmkgvx22 No. 16070167

The 13th pluralization.

Anonymous No. 16070173

Let J be the number of times a merchant has rubbed his hands together in satisfaction after closing a lucrative business deal, and let N be the number of times a diverse male has skipped town after impregnating a female.

J^N

Anonymous No. 16070183

>>16070173
Way to kill the thread. No one can compete with this.

Anonymous No. 16070220

8 but sideways

Anonymous No. 16070684

-1/12
which is the sum of all positive integers.

/thread

Anonymous No. 16070697

>>16070060
Pretty sure this wins. Though I would do it without the CS/programming nonsense and redefine L st. L(n) is the largest number that can be generated using n symbols that are either decimal digits or widely accepted R->R functions. The growth rate will be slower I think but the gist is the same. It encapsulates every other method for constructing a number so it's just a question of the constant you use as input.

Anonymous No. 16070874

>>16070684
-1/12 + 1

Anonymous No. 16070881

>>16070874
11/12 is quite meh. not even fucking 1

Anonymous No. 16070882

>>16070005
But 0-1+1 is just 0.

Anonymous No. 16070902

>>16070111
This + 1

Anonymous No. 16070947

"The biggest possible number that is possible to be the output of a C program containing at most TREE(Graham's number) characters."

Image not available

720x752

1653710570678.webm

Anonymous No. 16070955

I am extremely disappointed nobody here used hyper operators.
2[2]2 = 4
3[3]2 = 9
4[4]2 = 256
5[5]2 = 5^5^5^25
9[9]9 = yo mama

Anonymous No. 16070960

the size of ur moms butt lol

Anonymous No. 16070975

>>16070955
[Tree(Graham's number)][Tree(Graham's number)][5]

Anonymous No. 16071004

>>16070975
+1

Anonymous No. 16071016

the number of cocks that OP sucked

Anonymous No. 16071183

the first fixed point of f(x) = x + 1
>this number + 1
nice try. that's just my number again

Anonymous No. 16071184

>>16070173
Beautiful.

Anonymous No. 16071221

>>16069911
ฮฉ

Anonymous No. 16071240

Tree(Tree(Tree(...

I can prove this limit exists.

Anonymous No. 16071318

>>16071240
Tree(Tree(Tree(... isn't a limit. Also, if the process is repeated endlessly, as denoted by ..., you can't even prove the limit of the process exists. Also also, you can't take the limit of the Tree function, because it's only defined at natural numbers.

Anonymous No. 16071331

>>16069958
>Tree(3)
epic fail.
You mean TREE(3), although it isn't even a precisely defined number. All we know is it isn't infinite.

Anonymous No. 16071965

>>16071318
You're wrong all the way? Although this recursively defined sequence is unbounded because tree(n) is monotonically increasing so the limit doesnt exist. It is not "defined by ..."

Anonymous No. 16071968

1

Anonymous No. 16071976

>>16069911
10^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100^100 ^w^

Anonymous No. 16072467

>>16071976
Is this the largest one so far?

๐Ÿ—‘๏ธ Anonymous No. 16072482

9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^99

Anonymous No. 16072492

9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^99

Anonymous No. 16072496

>>16069911
>>16072467
>>16072492
What do I win?

Anonymous No. 16072500

OVER 9000

Anonymous No. 16072549

9!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

Anonymous No. 16072558

-1

Anonymous No. 16072735

TREE(Graham's number)!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

Anonymous No. 16072988

My cock's length in meters

Image not available

657x718

1706405324511012.jpg

Anonymous No. 16073002

โˆž

Anonymous No. 16073016

>>16073002
โˆž+1

Image not available

560x560

Untitled.png

Anonymous No. 16073381

>>16072467
No. There is literally no way to beat
>>16069930
Any answer given will be equal to or smaller than it once written out.

And you can't just +1 it cause then you end up with 0.

Anonymous No. 16073384

Every number above me and ever number below me multiplied together and added with 1

Anonymous No. 16073392

>>16073384
0

Anonymous No. 16073543

>>16069911
("summation of all the numbers that have been and will ever be expressed on 4chan that aren't an additve absorbing element")+0