Manfred comments on A basis for pattern-matching in logical uncertainty - Less Wrong

3 Post author: Manfred 29 August 2013 08:53AM

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

Comments (18)

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

Comment author: Manfred 15 January 2014 09:40:27PM 0 points [-]

What is "the low computing power limit"? If our theories behave badly when you don't have computing power, that's unsurprising. Do you mean "the large computing power limit".

Nope. The key point is that as computing power becomes lower, Abram's process allows more and more inconsistent models.

the probability of them appearing in the random process is supposed to be this ratio

The probability of a statement appearing first in the model-generating process is not equal to the probability that it's modeled by the end.

Comment author: Will_Sawin 16 January 2014 02:00:33AM 0 points [-]

Nope. The key point is that as computing power becomes lower, Abram's process allows more and more inconsistent models.

So does every process.

The probability of a statement appearing first in the model-generating process is not equal to the probability that it's modeled by the end.

True. But for two very strong statements that contradict each other, there's a close relationship.