Quote:
Originally Posted by abraxasinas
When the evil queen in snowhite concocted her poisoned apple redefining the most beautiful in the land; then this poisoned apple was indeed eaten by snowhite for a happy ending in the arms of her prince in the long run.

Somehow I knew this thread was going to get around to Computation Complexity Theory. Alan Turing committed suicide by eating a poison apple. Alan came up with the Turing Machine and the Turing Test. He is one of my hero's.
What about the halting problem for linearly bounded automata (Turing machine)? NP == P?