problems

Question 1

explorers/travellers problem

Answer 1

The solution finds a route that traverses each road exactly once before returning to the starting point. (Tractable)

Question 2

halting problem

Answer 2

The unsolvable problem of writing a program that can tell whether a given program and its inputs will halt, without running the given program.
(unsolvable)