You're looking at Less Wrong's discussion board. This includes all posts, including those that haven't been promoted to the front page yet. For more information, see About Less Wrong.

Houshalter comments on Computation complexity of AGI design - Less Wrong Discussion

6 Post author: Squark 02 February 2015 08:05PM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (69)

You are viewing a single comment's thread.

Comment author: Houshalter 03 February 2015 07:32:10PM 2 points [-]

I'm not very convinced. Relatively simple heuristics can perform very well on NP-complete problems. Machine learning methods can learn very accurate models of data, without doing Solomonoff induction.

I don't see any reason to believe an enormous amount of complexity is required to reach human abilities on these tasks.