Embedded Files
I moved to Dorn Data:
Iota Operation Type-1
Iota Operation Type-1
Definition:
O{q, p} = (
O = f(λ)(f(λ)(q)p){q ↑↑↑ (p ↑↑↑ (p+10)) - q}
)
λ ≜ 'The biggest finite cardinal definable with a greagol of symbols on von Neumann–Bernays–Gödel (NBG) set theory language.'
Uses Knuth Arrows, Fast Growing Hierarchy and NBG.
¿Bigger than Utter Oblivion?
Yes, technically because it's beyond of Utter Oblivion definition
thanks to Lambda Cardinal; which is obviously the
fastest cardinal ever created by its definition.
REFERENCES:
> https://googology.fandom.com/wiki/Knuth_Arrow_Theorem
> https://googology.fandom.com/wiki/Fast-growing_hierarchy
> https://googology.fandom.com/wiki/Greagol
> https://googology.fandom.com/wiki/Utter_Oblivion
> https://wikipedia.org/wiki/Von_Neumann%E2%80%93Bernays%E2%80%93G%C3%B6del_set_theory
> https://sites.google.com/view/dosserposts/contenido-2
DRAWER FUNCTION
DRAWER FUNCTION
Drawer Function is an computable function devised by M3gaEsc3ger. It is a one argument function that uses arrays and hyperoperators.
Definition:
Definition:
The Drawer Function looks like Drawer(n). And uses the value n with gigotion and explosion hyperoperators:
Drawer(n) ={n{{{n}}}n,2,1,1,3}
Sources:
Sources:
sites.google.com/view/dosserposts/contenido-2
http://www.polytope.net/hedrondude/array.htm
Page updated
Google Sites
Report abuse