Larks comments on A Little Puzzle about Termination - Less Wrong

2 [deleted] 07 February 2013 03:07PM

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

Comments (36)

You are viewing a single comment's thread.

Comment author: Larks 02 February 2013 05:56:12PM 0 points [-]

by the problem of induction, it cannot know with full certainty whether it has achieved its goal

The problem of induction is not relevant here. The real is that finitely many bits of information cannot move a bayesian reasoner from p in (0,1) to p in {0,1}.

Comment author: [deleted] 02 February 2013 06:33:07PM 0 points [-]

Strictly speaking the problem of induction is a deeper question concerning the justification of inductive methods; for the sake of clarity I've edited it to "due to the limits of induction", though I find this to border semantic pedantry...

Comment author: Larks 02 February 2013 07:54:15PM 3 points [-]

But the issue applies even to non-inductive knowledge. An AGI tasked to calculate pi to ten decimal places will still eat up the lightcone to check, due to the limits on deductive knowledge.

Comment author: [deleted] 02 February 2013 07:59:31PM 2 points [-]

Fair point; I overlooked that aspect. In any case, I've removed the (redundant) sentence altogether.