Comments on: Super Mario Bros. is NP-complete (sort of) http://www.kuliniewicz.org/blog/archives/2012/03/19/super-mario-bros-is-np-complete-sort-of/ After all, it could only cost you your life, and you got that for free. Mon, 28 Jan 2013 23:45:58 +0000 hourly 1 http://wordpress.org/?v=3.8.5 By: Paul Kuliniewicz http://www.kuliniewicz.org/blog/archives/2012/03/19/super-mario-bros-is-np-complete-sort-of/comment-page-1/#comment-4893 Fri, 23 Mar 2012 21:08:00 +0000 http://www.kuliniewicz.org/blog/?p=2389#comment-4893 In your defense, T. Rex didn’t do a very good job explaining the halting problem.

]]>
By: Ryan http://www.kuliniewicz.org/blog/archives/2012/03/19/super-mario-bros-is-np-complete-sort-of/comment-page-1/#comment-4887 Fri, 23 Mar 2012 00:52:31 +0000 http://www.kuliniewicz.org/blog/?p=2389#comment-4887 Then I think this illustrates quite well how little I learned from this dinosaur. :)

]]>
By: Paul Kuliniewicz http://www.kuliniewicz.org/blog/archives/2012/03/19/super-mario-bros-is-np-complete-sort-of/comment-page-1/#comment-4886 Thu, 22 Mar 2012 20:53:07 +0000 http://www.kuliniewicz.org/blog/?p=2389#comment-4886 Not really. The halting problem proves that there are some problems that computers fundamentally cannot solve; it’s actually the computational equivalent to Gödel’s incompleteness theorem. The P versus NP question is, roughly speaking, about whether there are problems that are inherently difficult to solve but easy to verify a solution to.

]]>
By: Ryan http://www.kuliniewicz.org/blog/archives/2012/03/19/super-mario-bros-is-np-complete-sort-of/comment-page-1/#comment-4885 Thu, 22 Mar 2012 02:47:58 +0000 http://www.kuliniewicz.org/blog/?p=2389#comment-4885 I thought the halting problem was related to P and NP?

]]>
By: Paul Kuliniewicz http://www.kuliniewicz.org/blog/archives/2012/03/19/super-mario-bros-is-np-complete-sort-of/comment-page-1/#comment-4882 Tue, 20 Mar 2012 22:52:38 +0000 http://www.kuliniewicz.org/blog/?p=2389#comment-4882 Ryan: I think you mean the halting problem.

]]>
By: Ryan http://www.kuliniewicz.org/blog/archives/2012/03/19/super-mario-bros-is-np-complete-sort-of/comment-page-1/#comment-4881 Tue, 20 Mar 2012 22:50:04 +0000 http://www.kuliniewicz.org/blog/?p=2389#comment-4881 I once had a dinosaur try to tell me about P and NP complete problems, but I never really figured out what the heck he was talking about.

]]>
By: fluffy http://www.kuliniewicz.org/blog/archives/2012/03/19/super-mario-bros-is-np-complete-sort-of/comment-page-1/#comment-4880 Tue, 20 Mar 2012 03:21:52 +0000 http://www.kuliniewicz.org/blog/?p=2389#comment-4880 Suddenly I want to have a gigantic computing cluster that does nothing but a breadth-first search on game states (with controller inputs as the edges) to find an optimal speedrun of a game to get the provably-best TAS.

]]>