This is a studio about large numbers. For an entire list of numbers,

go here http://googology.wikia.com/wiki/List_of_googologisms

These will include large numbers series, and ect. You may also add infinite ordinals, because of something called the Fast Growing Hierarchy that makes super large numbers.

Add projects about large numbers.

If it is not large numbers, then it gets deleted

You can become curator by making a function that grows around f ω (n) in the fast growing hierarchy. You can become Manager by getting

f ε0 (n) in the FGH. If you don't know the FGH, go here for an introduction:

http://googology.wikia.com/wiki/

Introduction_to_the_fast-growing_hierarchy

ω[n]=n

ω^(α+1)[n] = (ω^α)*n =

ω^α+ω^α+ω^α...

ω^α[n]=ω^(α[n]) if and only if α is a limit ordinal

(ω^a+ω^b+⋯+ω^k)[n] = (ω^a+ω^b+⋯)+(ω^k[n]) where

k is the smallest of a,b,c...k

ε0 [n] = ω^ω^ω^...ω with n-1 ω's