6 ms·

Exercise for the reader, make a quine that still works even if any one character is mutated (by 1 bit or 8?), rather than deleted.

• jxf 13y ago
  That definitely wouldn't work with this strategy (two copies), because you wouldn't be able to tell which copy was the mutated one. Error-correcting codes to the rescue. :)
  • ojii 13y ago
    couldn't one make 3 copies and take the two that are equal as non-modified?
    • eklavya 13y ago
      So like above said, error correction for at most one error.
    • Guillaume86 13y ago
      2 copy + one hash could do the same job?