I'm studying computability theory, and I'm looking for a problem that clearly can be solved, but not in polynomial time.
I tried thinking of all sort's of examples, but it wasn't clear why they can't be solved in polynomial time..
The travelling sales man problem.