User blog comment:Mh314159/new YIP notation/@comment-33713741-20190712201516/@comment-39585023-20190712235158

Thanks, FoundrElls! I just made an adjustment to the definition of n with an initial zero that increased growth rate of N bracketed terms. And I am ready to post the next few rules sets, the first of which is [a\b] and it generates recursions of N bracketed terms. But before I go too much further I'd like to have an idea of what kind of growth rates I am getting. I think PBot said that single bracketed number [n] has a growth rate of w^2+1 and this was before I made some changes that made it stronger, especially the g function which recurses the level of subscripts of the underline function. I'm very curious about the current growth rate of N bracketed terms. I don't want to go too far down a blind alley if this system is not as strong as I had hoped.