timtyler comments on A potential problem with using Solomonoff induction as a prior - Less Wrong

13 Post author: JoshuaZ 07 April 2011 07:27PM

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

Article Navigation

Comments (18)
Tags: bayesianism probability computability logic

Comments (18)

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

Comment author: timtyler 15 April 2011 02:04:46PM 0 points [-]

A hotline to a computable halt-finding machine seems much more plausible than something uncomputable, yes. We have no idea how something uncomputable could possibly work. You should not give weight to the uncomputable while computable approximations exist.

Comment author: ciphergoth 15 April 2011 03:19:24PM 1 point [-]

So how many cycles of

  • hypothesize a computable halt-tester
  • figure out from that an example where it makes the wrong call
  • test it, find that the experiment makes the correct call
  • hypothesize a new computable halt-tester that makes the correct call on this example

would you have to go through before concluding the universe was not computable?

I have to confess that I don't really see what's so special about the bottom of the compute hierarchy that you would be so certain that's where the universe is.

Powered by Reddit Powered by Reddit