User blog:Bubby3/Hypothetical analysis of SAN second generation with BMS

Here is my analysis of SAN past DDAN with BM4. A lot of you will object and say "It doesn't work" and will not analyze it. However, there is no function that is as strong as behaves the same. So, I am going to analze second generation SAN anaway, despite what people say.

With any non-working notation, there are two strength, it's working and hyphoteical. Iyts working strength is how the notations which don't produce a loop and terminate are. Hypothecial strength represents how strong would it be if it were fixed, and it didn't loop and always halt. Almost always, the hypotheical strength is much stronger, but there can be excpetions, namely where a problem causes the notation to be stronger than expected, then causes it to loop after that.

So, we know that the limit of DAN is (0,0,0)(1,1,1)(2,2,1)(3,0,0). Now we can extralopate to transfinite cases of how many droppers there are. We can continue with making n=seperators of seperators This function is realtively weak until (1:2){1:3} Similar things happen here at around {1{1,,2,,}2}, which casues it to be much stronger. This  causes {1{1{1(3:2){1:3}3:2}2:2}2} to be (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,2,0) instead of (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(5,2,0)
 * {1(1,2){1:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,0,0)
 * {1(1,3){1:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,0,0)(2,2,1)(3,0,0)
 * {1(1,1,2){1:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,0,0)(3,0,0)
 * {1(1`2){1:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)
 * {1(1(1`2){1:2}2){1:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(1,1,1)(2,2,1)(3,1,0)
 * {1(1)(1;2){1:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,0,0)
 * {1(1(1)(1;2){1:2}1,2){1:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)
 * {1(1(2)(1;2){1:2}1,2){1:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)
 * {1(1(1`2)(1;2){1:2}1,2){1:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)
 * {1(1)(1:2)(1:2){1:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(2,0,0)
 * {1{1:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,0,0) = limit of NDAN
 * {1(1){1:3}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,0,0)(2,1,1)(3,2,1)(4,1,0)(2,0,0)
 * {1(1:2){1:3}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,0,0)(2,1,1)(3,2,1)(4,1,0)(3,0,0)
 * {1{1(2:2){1:3}3:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,0,0)(2,1,1)(3,2,1)(4,1,0)(3,0,0)(2,1,1)(3,2,1)(4,1,0)(3,0,0)
 * {1{1(2:2){1:3}1,2:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,0,0)(3,0,0)
 * {1{1(2:2){1:3}1(2:2){1:3}2:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,0,0)
 * {1{1(2:2){1:3}1(2:2){1:3}1(2:2){1:3}2:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,1,0)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,0,0)
 * {1{1{2(3:2){1:3}2:2}2:2}2} has level (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,1,0)(4,0,0)
 * {1{1{1(3:2){1:3}3:2}2:2}2} has level  (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,2,0)
 * {1{1{1(4:2){1:3}1,2:2}2:2}2} has level  (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,2,1)(2,2,1)
 * {1(1`2:2){1:3}2} has level  (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,2,1)(3,1,0)
 * {1{1:3}2} has level  (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,2,1)(4,1,0)(3,0,0)
 * {1{1:3}2} has level  (0,0,0)(1,1,1)(2,2,1)(3,1,0)(2,2,1)(3,1,0)(2,1,1)(3,2,1)(4,1,0)(3,2,1)(4,1,0)(3,0,0)

...

WDEN has a limit of (0,0,0)(1,1,1)(2,2,1)(3,1,0)(4,2,0)

mWDEN has a limit of (0,0,0)(1,1,1)(2,2,1)(3,1,1)(3,0,0)