Tetronian 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.

Comment author: [deleted] 29 August 2013 09:54:13PM 0 points [-]

Highly related: Bayesian Concept Learning (pdf).

Comment author: Manfred 30 August 2013 01:08:50PM *  3 points [-]

Yeah, it's also closely related to minimum-message-length prediction.

But this isn't about learning from examples. Though man, the way I presented this article sure does seem like it's about learning from examples. Whoops, bad pedagogy.

It's about how, when we prove the number of smooth structures on R^2, we as humans automatically use that information to make predictions about the number of smooth structures on R^3. The question was - is there a basis for that that we can formalize?