Skip to content

P vs NP not well defined!

June 10, 2015

P vs NP depends on the assumption that the Turing machine truly represents the way humans solve problems.

What if this is not true?

What if there is construction in the Turing Machine that doesn’t account for the way humans solve problems.

The fact is P vs NP is not solved, and yet we keep solving hard problems.

My suggestion is to start over and analyse what is behind every row in the original paper of Alan Turing:

ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM

Advertisements

From → Philosophy

Leave a Comment

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: