User blog:QuasarBooster/Bashicu matrix version 4 in Python!

Yo! It's been awhile! Despite my random periods of inactivity on this wiki, I assure you that googology is always on my mind. I have another blog topic planned for later as well.

Anyway, I've finally started learning about the latest official version of BM. So here it is in my trademark obfuscated Python code! For any of you who know Python and also BMS, let me know if you think there's a mistake. For any others, ask me to explain how it works if you want! def Bm(n): m=n+1 S=0]*m,[1]*m] while S:    n*=n    N=S.pop    if sum(N):      r=range(len(N))      t=0      for i in r:        if N[i]:t=i      b=-1      while 0in[S[b][i]<N[i]for i in range(t+1)]:b-=1      l=len(S)+b      for k in range(n*-b):S+=[[S[b][i]+(N[i]-S[l][i])*(i<t)*(0not in[S[l][j]<S[l+k%-b][j]for j in range(i)if k%-b])for i in r  return n Mercifully, the new definition wasn't terribly different from the explanation in the article of version 1. Though I think that's not at all obvious at a glance from the ridiculously complicated expressions for BM4. Here's a question: is it correct to say that the parent column of an entry S_xy is the rightmost column for which all entries from rows 1 to y are less than the corresponding entries in column x? I.e. \[\begin{matrix} P_y(x)=\max\{p<x|S_{py}<S_{xy}\wedge\exists a(p=P_{y-1}^a(x))\}\\ ?\equiv?\\ \max\{p<x|\forall q\leq y(S_{pq}<S_{xq})\} \end{matrix}\] Because, if so, that definition is incredibly easier, at least to me, than the one provided in the article! Like jeez we should just use that one. Maybe I'm wrong though. Ranting aside...

Now that I feel more comfortable with the new version of BM, I might like to update the intuitive, non-mathematical explanation in the article since, again, it's really similar to version 1. Would anyone have any objections to that?