Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Can you link me to a proof demonstrating that the error can be made arbitrarily small? (Or at least a precise statement of the theorem you have in mind.) I would think that if the last step of error correction turns a correct intermediate result into an incorrect final result with probability p, that puts a lower bound of p on the overall error rate.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: