Mathematicians have categorized chess as a trans-computational problem. A transcomputational problem is one in which a computer would need to exceed the size of the earth in order to have the processing power to complete the theoretical problem through brute force. Also, to solve the game of chess means that everything would have to be decided on the first move and any subsequent deviation from the 'correct line' would result in a guaranteed loss. It is categorically different than having an engine who can win every game. Other games have been 'solved' like checkers, where the national championship has seen the exact line of play for numerous years in a row.
Also worth noting, the expression 'transcomputational' comes from Bremermann's limit - http://en.wikipedia.org/wiki/Bremermann%27s_limit - read up if you are unfamiliar.
My question is whether or not this is an accurate diagnosis? Does the math take into account the growing sophistication of chess engines, or even computers for that matter? Will we ever have a chess engine that can 'solve' the game of chess without exceeding the size of the earth. I guess to simplify my question; what is the context of this mathematical limit?