in thread "Life, Intelligence, and Consciousness are NP-Complete?": NP problems including NP complete ones can be verified in polynomial time. But it seems life generates solutions that can't be verified tractably sometimes. Many zero sum games like N x N Reversi are PSPACE-complete. See True Quantified Boolean Problems ht... 15h ago (collapse hidden) log in to judge received 1.9 1.9 NP problems includin (view hidden) log in to judge received 1.9 1.9