View Single Post
Old 01-21-2010, 05:46 PM   #762
Avalon Senior Member
Join Date: Sep 2008
Location: Los Altos California
Posts: 112
Default Re: Thuban Q&A: (warning longer than normal posts here)

Originally Posted by abraxasinas View Post
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?

Last edited by UncleJohn; 01-21-2010 at 05:52 PM.
UncleJohn is offline