SocialPipeline 08/13/2011 (a.m.)

• How computational complexity will revolutionize philosophy | KurzweilAI

  • Aaronson points out that this leads to a powerful new way to think about the problem of AI. He says that instead of “whatever a computer can do using fixed formal rules, it will never be able to ‘see’ the consistency of its own rules,” Penrose could say that even though the look up table approach is possible in principle, it is effectively impractical because of the huge computational resources it requires.

Posted from Diigo. The rest of my favorite links are here.