Jonathan_Graehl 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: cousin_it 31 July 2010 08:53:08AM *  2 points [-]

The proof checker checks proofs within some formal theory. The Godel sentence for the checker is certainly true and provable by us, given the consistency of that formal theory. (If the theory were inconsistent, the checker would be able to prove any sentence.) But this doesn't work as a proof within the theory! The theory cannot believe its own consistency (Godel's second incompleteness theorem), so the checker cannot assume it when checking proofs. So your argument doesn't actually give an example of a valid proof rejected by the checker.

Comment author: Jonathan_Graehl 01 August 2010 07:51:53AM 2 points [-]

the checker would be able to prove any sentence

I think you mean that there would be some proof (that checks) for any sentence.

Comment author: cousin_it 01 August 2010 07:54:53AM 2 points [-]

Yes. Thanks.