Transcription to Human Computer Code.docx

This is an archive of the transcription to 21st Century human computer code by Secretary Athena of the Sub-Department of Earthly Deities. If you are viewing this on a 21st Century human computer, realize that you will not be able to see all of the operations performed on higher-order computers as they actually were when performed. You will just be able to see a limited representation of them.

(1) ExtremityWikiDatabase(v. 1.0)/convert; command >> "extract code" .... *COMMAND COMPLETED*; current_coding_system=/lim.M(x(x(x/lim.M(M(x(x)))))) --> M(x(x(x/lim.M(x)))/ >> compress_system >> lim.(x)=(theta)mb->b=((nn(omega)*7dd&f,,ndfd*(Shaurlot system)>>n-m--graph--Mx(omega)=y>(x=lim.bi)>>2^bi=2^y:bi=b~END

NOTE:  What you have just seen is the mathematical formulation of the coding system {lim. M(x(x(x))) [where x = lim. M(M(x))] --> M(x(x(x))) [where x = lim. M(x(x))]}. To compress the system, the assertion {lim.(x) = $\theta$mb--> b} must be proven. The nn$\omega$ algorithm with the value of the Shaurlot system as its input is used to map n(m) to a graph of Mx$\omega$ which means that nn$\omega$undefined= 2y [where y is the y-constant (which is Mx$\omega$)]. It is then proven that y can be substituted for bi (i being the first totally non-embeddable cardinal) if {x = lim. bi} is true. If y can be substituted for bi, then {bi = b} is true. This also means that 2y = b, since 2bi = bi. Therefore, b can be substituted for 2y in $$\theta$$mb--> b. It also means that x = lim. 2y. What follows is the next part of the transcription process. >>>

~(2) mb->b,mb>2^y,mb^2> { (deriv. (1)) 2^y>2^bi,bi=b -fol. 2^bi=M_(embed)b^y*(saveas=c),2^c=M_(sub.of)bi,2^c>M_(embed)b^y,2^c2^y,..d>2^c,..d=y >> m(2^d)->2^d,m2^d=d,..d=embeddable(%),..md^2>d,..md^2>2^d*(saveas=et)%m2^d<2^d(saveas*ft)%m2^d=2^d*(saveas=gt) >> et ,m2^d->d=d_(embed)m2^d%ft,m2^d->d=d^(m2^d)%gt,m2^d->d=d ,M=embeddable ,>> |M=embeddable  (t%f' )| 2^bi=c,2^b=c,2^(2^y)=c,2^y>c,b>c,..bi=b,..bi->b=bi,2^bi>c - fol. 2^bi=inconsistent*(saveas=ht)%c=inconsistent(saveas=it) >> ht,2^bi>b,b=inconsistent,mb->b=inconsistent,(theta)mb->b=inconsistent,lim.x=inconsistent,x=consistent (f,M(x(x(x/lim.M(M(x(x))))) - fol. x=lim.M(M(x/lim.M(M(x/lim.>    ''