it means a computer able to calculate 50 moves ahead
I think you are right in your statement and don't think that it is ever achieved. Is it? 50 moves, or 100 half moves, would mean that a computer must evaluate an estimated 255+E152 positions.(*) Thats 255 with 152 zero's behind that.
(*) calculated with an average of 35 possibilities for every half-move
Yes... and no.
There is no way to avoid having to calculate a number of moves exponential with calculus depth, but there are ways to reduce considerably the calculation tree to a smaller exponential. A simple example is transposition tables. Imagine you calculated what is White's best move after 1.d4 d5 2.Nf6 Nf3. Then, you already know what to play in the event of 1.d4 Nf6 2.Nf3 d5 for instance.
A more sophisticated, and way more efficient example, is the alpha beta pruning, coupled with the search of so-called "killer moves". To simplify, say that you have seen that move A is refuted by move B in some variation. Then, when you calculate move A in another line, you try move B first because you assume it is more likely to refute move A than other moves ; and if it does refute move A, you do not need to calculate the others.
it means a computer able to calculate 50 moves ahead
I think you are right in your statement and don't think that it is ever achieved. Is it? 50 moves, or 100 half moves, would mean that a computer must evaluate an estimated 255+E152 positions.(*) Thats 255 with 152 zero's behind that.
(*) calculated with an average of 35 possibilities for every half-move