We prove that a wide range of coloring problems for graphs on surfaces can be resolved by inspecting finite number configurations.