Sunday, November 6, 2011

?? algorithm as categorified proof, vs ... ???? idea of "correctness proof" (??? ..... ?? and / or "termination proof" .... ???? ....) for algorithm .... ??? ....

?? idea that ... ?? interesting algorithms tend to be hard to be sure that they won't crash ... ??? ....

(?? not really sure whether i agree with that and / or whether it's true .... ??? ....)

?? loss of absolute convincing power ... ???

???? ....... ??? .....

No comments:

Post a Comment