News for hackers. Stuff that matters.
Re:When are two proofs essentially the same? (2007) by yMEyUyNE1 on Wednesday October 30, 2024 @02:42AM (#41992371)
>> An algorithm is not a proof.

> That is an opinion that many do not share.

Say, we have an algorithm to color a planar graph with 4 colors, can we say that we have a proof for 4-coloring a planar graph?

There are no comments on this comment yet.