With regards to 2), there's a difference between trying to find an answer to a single yes/no question, and trying to find a general method for solving an infinite class of such questions.
If a single yes/no question is clearly stated, then it does have an answer. This just a tautology - that's what it means to be clearly stated. For example, does there exist integers x, y, and z such that x^3 + y^3 + z^3 = 33? No one knows, but at least the question is clearly stated. The answer is definitely yes or no.
More generally, x^3 + y^3 + z^3 = 33 is an example of a Diophantine equation (an equation between multivariate polynomials with integer coefficients and integer variables). Suppose we are not so interested in this particular equation, but instead want to find an algorithm that can always tell if a Diophantine equation has a solution. This kind of question might not have a solution, since such an algorithm might not exists. And in fact, it doesn't (Hilbert's tenth problem).