again, not true. there are an infinite number of complexity classes beyond P that do not require "infinite space" or "infinite time".
exptime would just take exponential time instead of polynomial time, and pspace would just be able to reuse its available polynomial space (and thus use at worst exponential time). there are no problems that "would take infinite time" or "infinite space". there are problems that cannot be solved no matter how much space or time you give a computer, but that's a different matter altogether, and go isn't one of those problems. s. On Fri, Aug 8, 2008 at 6:53 PM, Robert Waite <[EMAIL PROTECTED]> wrote: >>> Besides... solving a >>> pspace-complete problem would require infinite memory... isn't that >>> correct? > >> nope. > > 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. > > > _______________________________________________ > computer-go mailing list > [email protected] > http://www.computer-go.org/mailman/listinfo/computer-go/ > _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
