See Computability theory. Basically, a problem is undecidable if there's not an algorithm/Turing Machine that could solve the problem in all instances.