> > I flipped memory and time there. If pspace-complete is not in p, then it > will be a big problem trying to solve it without infinite time. That doesn't > seem like an ideal situation for solving it. >
You only need an infinite amount of time for undecidable problems. np-complete, pspace, exptime, etc. are just intractable. I think we are more interested in how long before we can achieve superhuman play though, since perfect play seems impossible based on what we know about computation, the limitations of the physical world etc. I want to say 7-10 years, but it's really hard to predict when the necessary algorithmic advances will come. At worst we will just have to wait until robots take over the world in 20 years.
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
