巨大数列数(Huge sequence number)
A=9:dim B[∞] for C=0 to 9 for D=0 to A B[D]=D next for E=A to 0 step -1 A=A+1 for F=0 to E if B[E-F]<B[E] then for G=1 to A B[E+G-1]=B[E-F] next E=E+A:F=E endif next next next print A 例 0,1,2,3,2,2 0,1,2,3,2,1,1 0,1,2,3,2,1,0,0
Hu(x)=ω.
巨大行列数(Huge matrix number)
A=9:dim B[∞,∞]
for C=0 to 9
for D=1 to A
B[2,D]=1
next
for E=2 to 1 step -1
A=A+1
for F=0 to E-1
for G=1 to D
if B[E-F,G]<B[E,G] then
if B[E,G+1]=0 then H=F:I=G:F=E:G=D
else
G=D
endif
next
next
for J=0 to A
for K=1 to D
if K<I then B[E,K]=B[E-J,K]+J else B[E,K]=B[E-H,K]
next
if 0<H then E=E+1:H=H+1
next
H=0
next
next
print A
例
(0,0)(1,1)(2,2)
(0,0)(1,1)(2,1)(3,1)
(0,0)(1,1)(2,1)(3,0)(4,0)
(0,0)(1,1)(2,1)(3,0)(3,0)(3,0)
(0,0)(1,1)(2,1)(3,0)(3,0)(2,1)(2,1)
巨大数列を行列化。ε_0くらいのおおきさ。
原始数列数(Primitive sequence number)
A=9:dim B[∞] for C=0 to 9 for D=0 to A B[D]=D next for E=A to 0 step -1 A=A*A for F=0 to E if B[E-F]<B[E] or B[E]=0 then G=F:F=E next for H=1 to A*G B[E]=B[E-G]:E=E+1 next next next print A 例 0,1,2,2 0,1,2,1,2 0,1,2,1,1 0,1,2,1,0,1,2,1
または、一次数列数
P(x)=ε_0
大数列数(Large sequence number)
A=9:dim B[∞]
for C=0 to 9
B[1]=A
for D=1 to 0 step -1
A=A*A
for E=0 to D
if B[D-E]<B[D] | B[D]=0 then F=E:E=D
next
G=B[D]-B[D-F]-1
for H=1 to A*F
B[D]=B[D-F]+G:D=D+1
next
next
next
print A
L(x)=f_{φ(ω,0)}(x)
超数列数(Hyper sequence number)
A=9:dim B[∞]
for C=0 to 9
for D=1 to A
B[D]=D
next
for E=A to 0 step -1
A=A*A
for F=0 to E
if B[E-F]<B[E] then
if G=0 then H=F
for I=0 to H
if B[E-F+I]<B[E-H+I] then F=E:I=H:J=1
if B[E-H+I]<B[E-F+I] then I=H
next
if J=0 then G=F else J=0
endif
next
for K=1 to A*G
B[E]=B[E-G]:E=E+1
next
G=0
next
next
print A
例
0,1,2,3,2,3
0,1,2,3,2,2,3,2
0,1,2,3,2,2,3,1,2,3,2,2,3
0,1,2,3,2,2,3,1,2,3,2,2,2,2
0,1,2,3,2,2,3,1,2,3,2,2,2,1,2,3,2,2,3,1,2,3,2,2,2,1,2,3,2,2,3,1,2,3,2,2,2
H(x)=Γ_0
ペア数列数(Pair sequence number)
dim A[∞],B[∞]:C=9
for D=0 to 9
for E=0 to C
A[E]=E:B[E]=E
next
for F=C to 0 step -1
C=C*C
for G=0 to F
if A[F]=0 | A[F-G]<A[F]-H then
if B[F]=0 then
I=G:G=F
else
H=A[F]-A[F-G]
if B[F-G]<B[F] then I=G:G=F
endif
endif
next
for J=1 to C*I
A[F]=A[F-I]+H:B[F]=B[F-I]:F=F+1
next
H=0
next
next
print C
例
(0,0)(1,1)(2,1)(3,1)(2,0)(1,1)(2,1)(3,1)
(0,0)(1,1)(2,1)(3,1)(1,0)(1,1)(2,1)(3,0)(4,1)(5,1)(6,1)(5,0)(4,1)(5,1)
または、二次数列数 Pair(x)=Ψ_Ω(Ω_ω)
悪い部分決定に端の行の下降無しで(0,0)(1,1)(2,1)(3,1)(1,0)(1,1)(2,1)(3,1)=Γ_{ω+1}が停止しな
い最小の行列である。バシクトリ=(0,0)(1,1)(2,1)(3,1)(2,0)(1,1)(2,1)(3,1)[3]
バシクトリ数列数(Bashicu tri sequence number)
A=pow(10,100):dim B[∞,3],C[2]
for D=0 to 9
for E=0 to A
for F=1 to 3
B[E+1,F]=E
next
for G=A+1 to 1 step -1
A=pow(10,A)
for H=0 to G-1
for I=1 to 3
if B[G-H,I]<B[G,I]-C[I] | B[G,I]=0 then
if (0<B[G,1] & C[2]=0) | (0<B[G,2] & C[3]=0) | (I=3 & B[G-H,3]=0) then
if B[G,1]-B[G-H,1]=1 & (B[G,2]-B[G-H,2]=1 | C[2]=0) | I=3 then
for J=1 to A*H
for K=1 to 3
B[G,1]=B[G-H,1]+C[1]:B[G,2]=B[G-H,2]+C[2]:B[G,3]=B[G-H,3]
next
G=G+1
next
H=G:I=3
elseif 1<I
B[G,2]=0:G=G+1:H=G:I=3
else
I=3
endif
elseif I<3
C[I]=B[G,I]-B[G-H,I]
endif
else
I=3
endif
next
next
C[1]=0:C[2]=0
next
next
next
print A
このシステムでBEAFの定義と解析をします。
https://docs.google.com/spreadsheets/d/1MRpWakQ74Q7EOflZLa9klVVQXKSfe9uAxhv1tBP2GU8/edit?usp=sharing
バシク亜行列数(Bashicu Submatrix number)
A=9:dim B[∞,∞],B2[∞,∞],C[∞],C2[∞]
for D=0 to 9
for E=1 to A
B[2,E]=1,B2[1,E]=1
next
for F=2 to 1 step -1
A=A+1
for G=0 to F-1
for H=1 to E
if B[F-G,H]<B[F,H]-C[H] | B[F,1]=0 then
if B[F,H+1]=0 then I=G:G=F:J=H:H=E else C[H]=B[F,H]-B[F-G,H]
else
H=E
endif
next
next
if J=1 then
for K=1 to A*I
for L=1 to E
B[F,L]=B[F-I,L]
next
F=F+1
next
elseif B[F,H]=B[F,H-1]-B[F-I,J-1]
for M=1 to I-1
for N=1 to E
B2[M+1,N]=0
for O=F-I+M to F-I step -1
for P=1 to N
if B[O,P]<B[F-I+M,P]-C2[P] then
if P=N & B2[F-I+M-O,P]=1 then B2[M+1,N]=1:O=F-I else C2[P]=B[F-I+M,P]-B[O,P]
else
P=N
endif
next
next
for Q=1 to E
C2[Q]=0
next
next
next
C[J]=0
for R=1 to A
for S=1 to I
for T=1 to E
if B2[S,T]=1 then B[F,T]=B[F-I,T]+C[T] else B[F,T]=B[F-I,T]
next
F=F+1
next
next
else
for U=1 to A
for V=1 to E
if V<J+1 then B[F,V]=B[F-U+1,V]+1 else B[F,V]=B[F-I,V]
next
F=F+1:I=I+1
next
endif
J=0
for W=1 to E
C[W]=0
next
next
next
print A
バシク行列数(Bashicu matrix number)
A=9:dim B[∞,∞],C[∞,∞],D[∞]
for E=0 to 9
for F=0 to A
B[1,F]=1:C[1,F]=1
next
for G=1 to 0 step -1
A=A*A
for H=0 to G
if H=0 then I=G:J=F else I=G-K+H:J=0
for L=J to F
for M=0 to F
D[M]=0:C[H+2,M]=0
next
for N=0 to I
for O=0 to L
if B[I-N,O]<B[I,O]-D[O] | B[I,0]=0 then
if B[I,O+1]=0 & H=0 then
K=N:N=I:O=L
elseif O=L & N<H+1
if C[H+1-N,L]=1 then C[H+1,L]=1
N=I
else
D[O]=B[I,O]-B[I-N,O]
endif
else
O=L
endif
next
next
next
next
for P=0 to F
if 0<B[G,P+1] then D[P]=B[G,P]-B[G-K,P]
next
for Q=1 to A
for R=1 to K
for S=0 to F
if C[R,S]=1 then B[G,S]=B[G-K,S]+D[S] else B[G,S]=B[G-K,S]
next
G=G+1
next
next
next
next
print A
例
(0,0,0)(1,1,1)(2,1,0)(1,1,1)
(0,0,0)(1,1,1)(2,1,0)(1,1,0)(2,2,1)(3,2,0)
Bm(x).バシク行列数は512文字以内に定義されている
バシク数 (0,0,0)(1,1,1)(2,2,0)(1,0,0)[3]
オメガバシク数 (0,0,0)(1,1,1)(2,2,2)(1,0,0)[3]
トリオ数列数 (0,0,0,0)(1,1,1,1)(1,0,0,0)[3]
バシク超行列数(Bashicu hyper matrix number)
A=99:dim B[∞,∞],B2[∞,∞],C[∞],C2[∞]:C3[∞]
for D=0 to 99
for D2=1 to A
B[2,D2]=1
next
for D3=2 to 1 step -1
A=pow(A,A)
for D4=1 to D2
if 0<B[D3,D4] & B[D3,D4+1]=0 then
for D5=0 to D3-1
for D6=1 to D4
if 0<B[D3-D5,D6]<B[D3,D6]-C[D6] then
if D6<D4 then
C[D6]=B[D3,D6]-B[D3-D5,D6]
else
if D7=0 then D7=D5
D8=D8+1
C2[D8]=D5
for D9=1 to D6
B2[D3-D5,D9]=D8
next
for D10=1 to D4
for D11=D3-D5 to D3
for D12=D11 to D3-D5 step -1
for D13=1 to D10
if B[D12,D13]<B[D11,D13]-C3[D13] then
if D10=D13 then
if 0<B2[D12,D10] & B2[D11,D10]=0 then B2[D11,D10]=D8
D12=D3-D5
else
C3[D13]=B[D11,D13]-B[D12,D13]
endif
else
D13=D10
endif
next
next
for D14=1 to D2
C3[D14]=0
next
next
next
for D15=0 to D7
for D16=1 to D2
D17=0
if 0<B2[D3-D7+D15,D16] then
if D16<D4 then D17=B[D3-C2[B2[D3-D7+D15,D16]],D16]-B[D3-D5,D16]
endif
if B[D3-D5+D15,D16]<B[D3-D7+D15,D16]-D17 then
D15=D7:D16=D2:D18=1:D5=D3:D8=D8-1
elseif B[D3-D7,D16]-D17<B[D3-D5,D16]
D15=D7:D16=D2
endif
next
next
if D18=0 then D19=D5 else D18=0
endif
else
D6=D4
endif
next
next
D4=D2
endif
next
for D20=1 to D2
if 0<B[D3,D20+1] then C[D20]=B[D3,D20]-B[D3-D19,D20]
next
for D21=1 to A*D19
for D22=1 to D2
if 0<B2[D3-D19,D22] & B2[D3-D19,D22]<D8+1 then B[D3,D22]=B[D3-D19,D22]+C[D22]:B2[D3,D22]=B2[D3-D19,D22] else B[D3,D22]=B[D3-D19,D22]
next
D3=D3+1
next
for D23=1 to D3
for D24=1 to D2
B2[D23,D24]=0
next
next
D7=0:D8=0:D19=0
for D25=1 to D2
C[D25]=0
next
next
next
print A
BM=(0,0,0)(1,1,1)(1,0,0)(2,0,0)(1,1,0)(1,0,0)(2,0,0)