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: 478

Filed under:

quine

|

turing-complete

|

language-design

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

Shortest Ruby Quine

as seen on Stack Overflow - Search for 'Stack Overflow'
Just finished reading this blog post: http://www.skorks.com/2010/03/an-interview-question-that-prints-out-its-own-source-code-in-ruby/ In it, the author argues the case for using a quine as an interview question. I'm not sure I agree but thats not what this question is about. He goes on to construct… >>> More
Is this a valid quine?

as seen on Stack Overflow - Search for 'Stack Overflow'
def start(fileName): fileReader = open(fileName) for row in fileReader: print row, if __name__ == "__main__": import sys if len(sys.argv) <= 1: print "usage quine /path/to/file" sys.exit(-1) fileName = sys.argv[0] start(fileName) python quine.py foo >>> More
Code golf: Reverse quine

as seen on Stack Overflow - Search for 'Stack Overflow'
Write a program that outputs the reverse of its source code as a string. If the source is abcd efg (i.e., the C string "abcd\nefg") Then the output should be gfe dcba (i.e., the C string "gfe\ndcba") Bonus points for using esoteric languages such as brainf*ck. *EDIT:** Removed the unnecessary… >>> More
How could a quine in my programming language look?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have created a turing-complete programming language (already proven) so it must be possible to write a quine for it, right? But all quines I know store their source code in a string and then replace a special character in it using something like chr and ord. My language only has the following Basic… >>> More
Is it possible to create a quine in every turing-complete language?

as seen on Stack Overflow - Search for 'Stack Overflow'
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… >>> More

Related posts about turing-complete

Is CSS turing complete?

as seen on Stack Overflow - Search for 'Stack Overflow'
CSS isn't, insofar as I know, Turing complete. But my knowledge of CSS is very limited. Is CSS Turing complete? Are any of the existing draft or committees considering language features that might enable Turing completeness if it isn't right now? >>> More
Turing-Complete language possibilities?

as seen on Stack Overflow - Search for 'Stack Overflow'
In every Turing-Complete language, is it possible to create a working Compiler for itself which first runs on an interpreter written in some other language and then compiles it's own source code? (Bootstrapping) Standards-Compilant C++ compiler which outputs binaries for, e.g.: Windows? Regex Parser… >>> More
Practical non-Turing-complete languages?

as seen on Stack Overflow - Search for 'Stack Overflow'
Nearly all programming languages used are Turing Complete, and while this affords the language to represent any computable algorithm, it also comes with its own set of problems. Seeing as all the algorithms I write are intended to halt, I would like to be able to represent them in a language that… >>> More
Code Golf: Shortest Turing-complete interpreter.

as seen on Stack Overflow - Search for 'Stack Overflow'
I've just tried to create the smallest possible language interpreter. Would you like to join and try? Rules of the game: You should specify a programming language you're interpreting. If it's a language you invented, it should come with a list of commands in the comments. Your code should start… >>> More
What is Turing Complete?

as seen on Stack Overflow - Search for 'Stack Overflow'
What does the expression Turing Complete means? Can you give a simple explanation, without going into too much theoretical details? >>> More