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 An additional problem with Solomonoff induction - Less Wrong Discussion

2 Post author: gedymin 22 January 2014 11:34PM

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

Comments (51)

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

Comment author: solipsist 23 January 2014 08:38:02PM *  -1 points [-]

Before you know it, you have the full code necessary for directly simulating the laws of physics and then some icing on top.

I agree! Is that a problem? I expect that program to be less than a few hundred bits long, so Solomonoff induction will zero in on the correct laws of physics with less than a few hundred bits* of evidence. That seems perfectly acceptable.

*a few hundred bits of evidence will take more than a few hundred bits of sensing data, unless the sensing data is incompressible.


edit: or is your point...

Nope, the first one

Comment author: private_messaging 23 January 2014 08:45:28PM *  1 point [-]

agree! Is that a problem? I expect that program to be less than a few hundred bits long

You see, this is why I kind of don't even want to bother ever discussing it any more. Ohh, I expect this, I expect that... on what basis, none whatsoever. It's hundreds bits merely to locate the camera, for god's sake. Let's say I expect a god in 50 bits, for the sake of argument.

edit: and by the way, for the laws of physics as we know them - non discrete - an exact representation is not even possible.

*a few hundred bits of evidence will take more than a few hundred bits of sensing data, unless the sensing data is incompressible.

Up to BusyBeaver(a few hundreds) bits of sensing data (edit: which is due to it being easy to set up codes that are identical until very many bits are outputted) .