Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on When are two proofs essentially the same? (2007). Parent comment
> 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.
> 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?