@ngn Sure, all digits, and all primitive functions and monadic operators, but those are usually disqualified. Certainly, the single-digit ones are not new.
The basic definition of a quine is a program that, when run, produces its own source code as output. There are a number of techniques and a number of way to implement those techniques across a number of different languages.
However, not all quine programs are equal. Clearly, any quine in HQ9+ or...
> It must be possible to identify a section of the program which encodes a different part of the program. ("Different" meaning that the two parts appear in different positions.)
Furthermore, a quine must not access its own source, directly or indirectly.
@ngn (and ,0) may not be, because they just rely on a specific output format for the value generated, rather than actually returning the source code text.
@ngn Even Hofstadter admitted that it is hard to define exactly what constitutes a quine.
@ngn imo yes, that's a quine, but it's a boring quine (as opposed to a non-boring one). I think that objectively trying to define that to not be a quine is just stupid
in a DyalogREPL language, which has no way of getting input and puts its code in the Dyalog REPL, it sure would count using ⍞, as that's just a very strange built-in to get the next code line as text
Using your language of choice, golf a quine.
A quine is a non-empty computer program which takes no input and produces a copy of its own source code as its only output.
No cheating -- that means that you can't just read the source file and print it. Also, in many languages, an empty file is...
Using your language of choice, golf a quine.
A quine is a non-empty computer program which takes no input and produces a copy of its own source code as its only output.
No cheating -- that means that you can't just read the source file and print it. Also, in many languages, an empty file is...
