hairyfigment comments on Probabilistic Löb theorem - Less Wrong

24 Post author: Stuart_Armstrong 26 April 2013 06:45PM

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

Comments (39)

Sort By: Best

You are viewing a single comment's thread.

Comment author: hairyfigment 27 April 2013 08:53:01AM 0 points [-]

P('¬F') ≥ a. Since probabilities sum to one, the system can prove that P('F') < 1-a.

You mean, because we can always replace the first "a" with some b>a?

This seems like a very cool - and bizarre - result.

Comment author: Stuart_Armstrong 27 April 2013 06:44:21PM * 0 points [-]

Sorry, a bit sloppy with the > and ≥ - since you can always choose a slightly larger "a", it still works out. I've corrected the text.