Y
Hacker News
new
|
ask
|
show
|
jobs
by
hyborg787
4495 days ago
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.
1 comments
jxf
4495 days 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. :)
link
ojii
4495 days ago
couldn't one make 3 copies and take the two that are equal as non-modified?
link
eklavya
4495 days ago
So like above said, error correction for at most one error.
link
Guillaume86
4494 days ago
2 copy + one hash could do the same job?
link