Hardest Program

1. Prove P=NP

• to show that the complexity measure TM.

• Never considering input size.

• Algorithm is ambiguous in how it is phrased. That is, it is not clearly stated and usually hand-waves a pretty important step or two.

• Very common is that the author will consider an NP-complete problem then will incorrectly interpret it as something else to in a way tackle a much simpler version of the problem.

In python, What is a generator?