Is it possible to create a quine in every turing-complete language?

Posted by sub on Stack Overflow See other posts from Stack Overflow or by sub
Published on 2010-04-02T17:10:32Z Indexed on 2010/04/02 17:13 UTC
Read the original article Hit count: 484

I just wanted to know if it is 100% possible, if my language is turing-complete, to write a program in it that prints itself out (of course not using a file reading function)

So if the language just has the really necessary things in order to make it turing complete (I would prove that by translating Brainf*ck code to it), like output, variables, conditions and gotos (hell yes, gotos), can I try writing a quine in it?

I'm also asking this because I'm not sure that a quine directly fits into Turing's law that the turing machine is capable of any computational task. I just want to know so I don't try for years without knowing that it may be impossible.

© Stack Overflow or respective owner

Related posts about quine

Related posts about turing-complete