# For a computational problem, can the set of instances be finite?

A computational problem consists of a set of instances. In most cases the set of instances is infinite. Like the set of all graphs, e.g.:

Given a graph $G$, is there a Hamiltonian circuit in $G$?

Can the set of instances be finite and a problem still be non-trivial?