I've read up a bit on AI-completeness and want to put forth a hypothesis:
Any true artificial intelligence technology is AI-complete.
This means that any truly intelligent/conscious feature of an AI will only be developed when a true AI is developed. It also means that chess (the way current programs 'play' it) is not true AI. I also wonder how this would affect the Turing Test.
A corollary would be:
Any approximation of a true AI technology is not necessarily AI-complete as it is not true AI.
An example is, again, how chess is currently handled. A computer can be 'great' at chess simply because it can test possible plays faster than a human can. This is an approximation of playing chess intelligently.
How would we go about proving this? The first step is to create formal definitions of AI-complete, true AI, artificial intelligence technology, and an approximation of a true AI.