The Hardness of the Hard Problem in Computational Terms

November 28, 2010

Concerning David Chalmers’s Hard Problem of consciousness

There’s roughly four grades of easiness-difficulty:

  1. Complete theoretical and practical sucess, eg chess
  2. Partial theoretical and practical success, eg translation
  3. Practical failure, theoretically explained, eg halting problem
  4. Not even a theory, eg qualia. Ask a programmer how

to write a feeling algorithm, and they’ll look at you
like you’re crazy. There isn’t even a theory explaining
why it’s impossible. No-one knows where to start.


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 )

Google photo

You are commenting using your Google 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 )

Connecting to %s

%d bloggers like this: