Unrepetition

Unrepetition is a combination of Regex, and UnCompetition. the original idea was created by User:Ϫ, however it was fully expanded by User:Yayimhere.

How it functions

fundementally, UnCompetition and Unrepetition function the same, both generating a tree of programs in their own respective language(so no, Unrepetition does not generate UnCompetition programs, it generates Unrepetition programs).

however, in Unrepetition, below what would be a standard UnCompetition program, there is a ––––––––, and then an unlimited number of regex replacements are listed, each replacement is on its own line, written in PCRE specifically(if there is no divider, then that means there is no regex ). now when the basic Unrepetition program P1 is ran, first a Unrepetition program P2 is generated(both with and without the regex section), and then the regex replacements are applied to each P2(each replacement is ran top to bottom), before they themselves are ran. the regex of P1 only applies to P2, and the regex of P2 only applies to every P3, and so on.

as Unrepetition has more control on the individual programs, it is most likely useful tool for proving UnCompetition's computational class, though if proved through translation, a third, and maybe even a fourth intermediate language may be needed.