Has anyone constructed a Quine program for a Turing machine?
Five symbols per instruction. Starting with a blank tape.
Halting when every instruction in memory has been written to the tape.
Due to the nature of Turing programs, the instructions can be in any order.
A Brainf*ck Quine was relatively easy. The Turing Quine is a slippery one.
Five symbols per instruction. Starting with a blank tape.
Halting when every instruction in memory has been written to the tape.
Due to the nature of Turing programs, the instructions can be in any order.
A Brainf*ck Quine was relatively easy. The Turing Quine is a slippery one.