GRG

GRG or Growth Rate Growth is a semi-theoretical esolang created by User:Yayimhere(as In not all formal specifics have been defined), in his search for the computational class of UnCompetition. it is a combination of a single growth rate function, a few optional Uncompetition, and in the Unrepetition oriented version, some regex. GRG is most likely approximately as useless as Uncompetition for normal program, but, who knows!!! Although it may be a little bit more useful.

How it functions

GRG is made to compile into either an UnCompetition program, or an Unrepetition program. for UnCompetition see GRG-𝒜(also referred to as GRG-A, GRG-Alpha, or just 𝒜), and for Unrepetition see GRG-𝔅(also referred to as GRG-B, GRG-Beta, or just 𝔅).

GRG-𝒜

A GRG-𝒜 program consists of three parts separated by , and terminated by .. the first is a function(f(x)=body), with the body using the following math operators + - * / %(modulo) n√x(n'th root of x) x^n !n(n factorial) (...)(brackets), and the numbers used can be any positive integer, and x, which is the function input.

The second is any positive integer n, encased in square brackets.

A python style set({}), where each object is a UnCompetition command/single line program(for example ! and [1]).

now, how does GRG-𝒜 compile into UnCompetition. It takes our defined function, and feeds it n as defined before. the function is a growth rate function, and n is the amount of programs created from P1. now the functions output is fed back into the function, ect ect. GRG-𝒜 compiles this growth rate into UnCompetition, but creating a program that will create a tree with the same growth rate. the python style set are simply some commands that are tried to be used within our generated program, however, if not possible, they will not be included.

GRG-𝔅

GRG-𝔅 is in function fundamentally the same as GRG-𝒜, however, it compiles into Unrepetition instead of UnCompetition. It also does not have the python style set, as Unreptitions growth is in some aspects a lot more complex than UnCompetitions.

Theoretical status

GRG is marked as theoretical, because there is currently no known function for compiling it into UnCompetition and Unrepetition. As so, multiple different versions of GRG may exist, with a different function for compilation(if you create one, please make a separate page for it, but do put it in the see also section of the article).