Omninaccassible

Omninaccessible is equal to \((0,0,0)(1,1,1)(2,1,1)(3,1,1)[100]\) in an unspecified Bashicu matrix system in the original definition,Hayden's Big Numbers. Retrieved 2022-10-09. and it's equal to \((0,0,0)(1,1,1)(2,1,1)(3,1,1)[100]\) in the Bashicu matrix system with respect to version 2.3 = 4, simulating Hardy hierarchy, in the new definition.Hayden's Big Numbers. Retrieved 2024-01-27.. This term was coined by HaydenTheGoogologist2009.
In the fast-growing hierarchy, it's intended to be comparable to \(f_{\psi(\psi_{I_{\omega}}(0))}(100)\) with respect to an unspecified (and perhaps ill-defined) OCF \(\psi\) and an unspecified (and perhaps ill-defined) system of fundamental sequences.
==Approximations==
Here, we write approximations of this number with respect to the current definition.
Notation 	Approximation
Strong array notation (intended)	s(100,100{1,,1,,1,2}2) (debatable)
DeepLineMadom's Array Notation 	\(100[1\{1\backslash 1\backslash 1,2\}2]100\) (debatable)
KumaKuma ψ function 	\(f_{\psi_0(0,\psi_{$\omega}(0,0))}(100)\) (debatable)
==Sources==
Category:Numbers
Category:Numbers by HaydenTheGoogologist2009
Category:Higher computable level
Category:Powers of 10