User:Cloudy176/Department of bubbly negative numberbottles/Boris's sezration notation

Boris's sezration notation is a notation devised by Wiki user Boboris02 as an atempt to create a function,that grows faster than any computable expression in the Fast-Growing Hierarchy.

The power of the notation beyond Upper Sezration is controvertial,since many say it is nowhere near the bounds of the FGH.Neither believes have been prooven right,nor wrong,since the Ultra-Sezration notation

works in such a way,that it's hard to compear to the FGH.

Tipes of Sezration

 * 1) Simple Sezration
 * 2) Extended Sezration
 * 3) Levelar: (Third,fourth,fift....) Level Sezration
 * 4) Higher Dimentional Sezration
 * 5) Higher notational (Tetrational,Pentational,Hexational,....) Sezration
 * 6) Upper Sezration
 * 7) Ultra-Sezration

Simple Sezration
Simple Sezration is the weakest/slowest growing of all Sezrations,but it is the base for them.

It can be abbriviated to only 2 rules:

Rule 1:\([A,B]=a\rightarrow a\rightarrow a\rightarrow ...\rightarrow a\),whre there are \(B many A's\).

Rule 2:\([A,B,C]=[C,[A,B]] and [A,B,C,D#]=[#,[D,[C,[A,B]]]] for # denotes the rest of the chain\).

The grouth rate of Simple Sezration is about \(f_{\omega^{2 }} (n)\) and it is comparable to the \(CG(n)\) function.