> For example, the problem of determining whether a graph has a Hamiltonian cycle is in NP; given a path in the graph, it is fast to verify whether or not it is a Hamiltonian cycle.
Submitter is a bit out of touch with reality if he thinks "Non-Mathematicians" will get that example. Nice read overall though.