Sewing-Machine comments on AI cooperation is already studied in academia as "program equilibrium" - All

35 Post author: cousin_it 30 July 2012 03:22PM

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

Comments (42)

You are viewing a single comment's thread. Show more comments above.

Comment author: [deleted] 31 July 2012 12:03:03AM 1 point [-]

Since we expect P != NP, finding proofs is an exponential search problem.

P != NP does not imply that one can't do better than an exponential search for finding proofs. For instance an O(n^log(n)) algorithm for finding proofs would not contradict P != NP.