language-design - 是否可以用所有图灵完整的语言创建一个quine？

Question

我只是想知道是否有100％的可能性，如果我的语言是完整的，就可以在其中编写一个打印出自己的程序(当然不使用文件读取功能)

因此，如果该语言只有真正必要的东西才能使其完整完成(我将通过翻译Brainf * ck代码来证明它)，例如输出，变量，条件和gotos(是的，gotos)，我可以尝试在里面写一个提子吗？

我也在问这个问题，因为我不确定奎因是否直接适合图灵定律，即图灵机可以执行任何计算任务。
我只想知道，所以我多年尝试不知道这可能是不可能的。

Answer 1

Any programming language which is Turing complete, and which is able to output any string (by a computable function of the string as program — this is a technical condition that is satisfied in every programming language in existence) has a quine program (and, in fact, infinitely many quine programs, and many similar curiosities) as follows by the fixed-point theorem.

See here