A minimal quine just prints itself out as "source" code. You can choose the source language to be whatever you like, such as a minimal Turing complete combinato

A minimal quine just prints itself out as "source" code. You can choose the source language to be whatever you like, such as a minimal Turing complete combinator. So all you need is an interpreter for the base level, which could be something as simple as Rule 110[1]. It really doesn't matter what Turing-complete language you choose; they can all be implemented in terms of each other, so as soon as you have your quine one language you could as well do it any other. [1] https://en.wikipedia.org/wiki/Rule_110 https://en.wikipedia.org/wiki/Rule_110