[JoshCole]

Waiting for your rebuttal. Worth nothing the problem isn't theoretical. We actually run into this 'we can't compute it fast enough' problem in practice.

- When we tried to solve chess we couldn't, the branching factor was too much.

- Go, it was horrendous there too.

- Poker, terrible there too.

But you want to dismiss me on the basis of jargon right? So here you go. Bellman coined the term curse of dimensionality. Combinatorial explosions happen because of branching factors in game graphs. Computational complexity for algorithms are defined with respect to this graph in both time and space for many learning algorithms. Because the games get so big the curse of dimensionality forces problem relaxation. I used ~words~. I must be an idiot. Feel free to dismiss me, I guess. I heard you heard someone else use words once and they were ~wrong~.

Hey wait a second. You're using words too. Does that mean everything you say is wrong?