shminux comments on Reflection in Probabilistic Logic - Less Wrong

63 Post author: Eliezer_Yudkowsky 24 March 2013 04:37PM

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

Comments (171)

You are viewing a single comment's thread.

Comment author: shminux 24 March 2013 06:48:53AM 4 points [-]

A stupid question from a dilettante... Does this avenue of research promise to eventually be able to assign probabilities to interesting statements, like whether P=NP or whether some program halts, or whether some formal system is self-consistent?

Comment author: Eliezer_Yudkowsky 24 March 2013 08:03:41AM 9 points [-]

Promise? No. Might it start down an avenue that someday leads there after a whole lot more work and some additional ideas? Maybe. Don't hold your breath on that P!=NP formal probability calculation.

Comment author: shminux 24 March 2013 06:25:09PM 3 points [-]

Hey, a man can hope. Interesting how it used to be physics driving the progress in math, and lately it's been computer science.

Comment author: Will_Sawin 17 April 2013 05:07:44AM 0 points [-]

This comment is a grossly oversimplified perspective, I think.

Comment author: benelliott 26 March 2013 01:14:50PM 3 points [-]

Maybe I'm misunderstanding here, but it seems like we have no particular reason to suppose P=NP is independent of ZFC. Unless it is independent, its probability under this scheme must already be 1 or 0, and the only way to find out which is to prove or disprove it.

Comment author: endoself 26 March 2013 11:12:45PM 1 point [-]

I think shminux is talking about the possibility of future research addressing bounded reasoners, who could be uncertain of P=NP even if it followed from ZFC.

Comment author: benelliott 26 March 2013 11:57:07PM 2 points [-]

I fully agree that is an interesting avenue of discussion, but it doesn't look much like what the paper is offering us.

Comment author: abramdemski 25 March 2013 01:02:05AM 1 point [-]

... Or a probability for the continuum hypothesis, axiom of choice, et cetera, if the probabilistic set theory works out. :)

Comment author: MrMind 25 March 2013 10:36:47AM 0 points [-]

While set theory already does that within forcing language (kinda, truth values are in a boolean algebra instead of a ring) for CH, AC, etc., the values of P!=NP cannot be changed if the models have the same ordinal (due to Shoenfield's absoluteness theorem). I really hope that Probabilistic Set Theory works out, it seems very interesting.