I am not sure that this statement is correct, or rather it is correct for only the simplest of programs or algorithms.
There are subtleties relating to Algorithmic Information Theory when it comes to expressing information in coded form that make it a nontrivial issue to "prove" that code is or is not error-free. Too, there are constraints related to incompleteness theory involved.
Finally, to my knowledge none of this has anything to do with factoring large prime numbers.
Peace,
D-d0g
Slashdot Mirror
I am not sure that this statement is correct, or rather it is correct for only the simplest of programs or algorithms. There are subtleties relating to Algorithmic Information Theory when it comes to expressing information in coded form that make it a nontrivial issue to "prove" that code is or is not error-free. Too, there are constraints related to incompleteness theory involved. Finally, to my knowledge none of this has anything to do with factoring large prime numbers. Peace, D-d0g