I have never read the Wikipedia article on solving chess. However I have looked at many other sources, in particular those concerning the physical limits of computation. If you read my posts in this thread you can see that I have come to conclusions which are almost identical to that of the Wikipedia article.
Unless there is some unexpected turn in our understanding of physics ( I mean a dramatic development, for example the possibility of hypercomputation ) or we can come up with some magic formula which can predict the outcome of complex and general chess positions with certainty ( none of the above is likely ), the solution remains a tough problem.
What do you mean solved?
Let's say a computer program is eventually invented that achieves a rating of 3500. And no human can ever beat it (I would say if it plays 1,000 games against the top 10 GMs and loses none as black or white, that is proof of its unbeatableness, some may disagree with the 1,000 figure but that's up to an individual: there is a number that realistically constitutes proof).
Then you set it to play itself, and over 1,000 games, it's record is W0, L0, D1000
Is that solved?
It might be solved in that maybe the software will find in any position a move that doesn't change the evaluation. But you have no proof that it is solved.
Such a computer is essentially an oracle - you never caught it wrong, but how do you know it will never be?