User blog comment:Mh314159/new YIP notation/@comment-39585023-20190717145858

I have added a proposed new set of Universal Rules which make it possible to have an unlimited string of type "g" functions to recurse the subscripts before reaching the type "underline" function which decrements the subscripts in order to reach the base function. These new rules make all other structures extremely more recursive. Scroll to the bottom to see them.

I came here for a personal challenge to make a recursive numerical function that reaches TREE3. Maybe I won't achieve that, but I think I have gone a long way from my first efforts. But it seems that the experts are no longer looking at my work. Without expert evaluation and feedback I don't know what I am accomplishing, so if I don't get that feedback I may stop posting these efforts. Does anyone have any suggestions for other places I might go for expert feedback in a civil forum?