As each brigade emerged from the woods, from 50 to 100 guns opened upon it, tearing great gaps in its ranks; but the heroes pressed on and were shot down by reserves at the guns. It was not war, it was murder.
The classes of problems which are respectively known and not known to have good algorithms are of great theoretical interest. [. . . ] I conjecture that there is no good algorithm for the traveling salesman problem. My reasons are the same as for any mathematical conjecture: (1) It is a legitimate mathematical possibility, and (2) I do not know.