You're looking at Less Wrong's discussion board. This includes all posts, including those that haven't been promoted to the front page yet. For more information, see About Less Wrong.

solipsist comments on Understanding and justifying Solomonoff induction - Less Wrong Discussion

1 Post author: gedymin 15 January 2014 01:16AM

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

Article Navigation

Comments (75)

Comments (75)

You are viewing a single comment's thread.

Comment author: solipsist 15 January 2014 03:32:22AM 0 points [-]

Additional justification: if your data can be perfectly described by a 1000 bit program, you will find that program after at most 1000 + c bits of evidence.

Comment author: lavalamp 16 January 2014 09:31:44PM 1 point [-]

I think you mean BB(1000) bits of evidence?

Comment author: solipsist 16 January 2014 11:31:57PM *  -1 points [-]

I was measuring the Kolmogorov complexity of the evidence, but now that you mention it that does make for a bit of circular reasoning.

Comment author: lavalamp 17 January 2014 01:53:23AM 0 points [-]

Ah, I see. Yeah, 1 bit in input bitstream != 1 bit of bayesian evidence.

Comment author: Eugine_Nier 15 January 2014 05:27:28AM -1 points [-]

Assuming you have access to a source of hypercomputation, in which case the universe can't be described by a turing machine anyway.

Powered by Reddit Powered by Reddit