Vladimir_Nesov comments on AI cooperation in practice - Less Wrong

26 Post author: cousin_it 30 July 2010 04:21PM

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

Comments (157)

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

Comment author: Vladimir_Nesov 31 July 2010 08:30:53PM *  1 point [-]

For a finite set of proofs, that a given statement is not provable by a proof from that set, is provable, possibly by a proof from that set.

Comment author: cousin_it 31 July 2010 09:14:30PM *  2 points [-]

Technically true. You could always just evaluate the two statements and there you have your proof, with length exponential in n. I very much doubt the proof could be made shorter than n though, because the statement is equivalent to "you can't find a contradiction in these axioms using less than n steps", the difficulty of which should grow way faster than linearly in n.