Registered: Oct 2004
Posts: 3

I've been reading NKS and come across the discussion of computational complexity.

As a non-mathematician, I am trying to get a handle on what this means and, in particular, the notion of PSPACE. I am currently working on a go application and it is indicated as PSPACE hard.

Does anyone have a good resource to break down the levels of complexity (and their meaning)?

cm

Report this post to a moderator | IP: Logged

Registered: Aug 2003
Posts: 712

See -

http://www.wolframscience.com/nksonline/page-1142b-text

Report this post to a moderator | IP: Logged

Registered: Jan 2004
Posts: 16

I strongly recommend Scott Aaronson's website at
http://www.complexityzoo.com/

Report this post to a moderator | IP: Logged