User talk:Mush9

New user, new googologlists. AarexWikia04 - 17:41, October 7, 2016 (UTC)

And it's allways exaiting!Boboris02 (talk) 16:46, October 12, 2016 (UTC)

I can help you with NOOP notation...

My idea is that you can construct large self-accelarating set structures in ZFC as your starting point.We can even make your own type of theory similar to ZFC.I'm going to refer to it as MOT (Mush9's Output Theory).

Let's have \(a \cup b\) in MOT, have \(a \in b\) sets of \(a \bigcup x\),where \(x\) is a \(a \land^z b\) structure with b+1 states,where \(z\) will be the smallest nonnegative finite integer,that is not accesable with just the logical connectivities used in ZFC in \(a \cup b-1\) in MOT characters or less.(these are \( \land,\lor,\neg,\Rightarrow,\Leftrightarrow,\forall,\exists \text:and \)) and \(a \land^n b\) will be the first unprovable set in a \(a \land^{n-1} b\) languige.

Right now this is ill-defined,because "a \(a \land^{n-1}\) languige" is not properly defined.

But we can do so!

Let \(\forall b \exists z > \Delta_x[b] \) be the Axiom of functions,which will be our first statment for MOT.

This means for any integer \(b\),there is an integer \(z\) which is greater than any function \(\Delta_x\) which is describable in no less than \(b\) symbols (describing any symbol as a single bit) in an \(\Phi(n)=Phi_1(0)\neg n\)system and \(x\) is an integer povable in ZFC in finite steps.

This theory is quite new,but perhaps we could extend it furthur together,if you like my idea!

Are you up to the challenge?

Boboris02 (talk) 16:33, November 12, 2016 (UTC)