User blog:Ynought/FC0 O function

so first \(F(n)\) =(n[n[n..n times...[n]n]...n]n)(n[n[n..n times...[n]n]...n]n)[n]

Terminology:

\(A\) is the n in [n]

\(B\) is the cell next to [n]

\(C\) is the system without \(B\)

then lets define the seperator {k} like :

if k=1 then (a{1}c)= (a{c-1}c-1)[n] cell that are (a{c-1}c-1)

if k>1 then (a{b}c) gets solved like so \(A\) then reduce c by one then \(ad c to b\) and create b new \(C\) cells.by the time c is reduced to 1 (a{k}1) turns into \(F(k)\) cells that have k entries with [k] seperators inbetween the entries have value a

Then i define \(O(n)\) as (n{n}n)(n{n}n)...n times(n{n}n)[n]