This question already has an answer here:
I was hoping to answer a question using a particular cellular automaton that was defined 17 years ago (before the question was asked) but for which I am unable to find a free interpreter on the internet.
If I made an implementation that followed the specifications formally laid out in the paper that introduced this cellular automata would I mark my answer as non-competing?
It has been agreed upon that answers languages made after a challenge must be marked as non-competing. It is also agreed upon that a language is dependent on its implementation and not its specification.
The implication of these two existing rules is that I would. However the intention of the former is to keep people from making up new languages to beat a challenge while that is certainly not what is going on here. There was no way that either myself or the person that designed this language could have had any knowledge of a PPCG challenge 17 years ago.
Are answers in languages that were specified prior to a challenge and had no extant implementations at the time the question was asked considered competing?