= 27d567bc2d48d9f40e9ccc20ea370b15)
SilasBarta comments on Let's reimplement EURISKO! - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (151)
Yes, it is, my mistake. I now have all three papers. I've temporarily put them up in the directory here, a URL to which you will have to add lenatN.pdf for N = 1, 2, or 3. (I'm avoiding posting the complete URL so that Google won't find them.)
I'd like to echo cousin_it's thanks, I downloaded them as well.
I haven't gotten to read much yet, but I've also run into the problem he's mentioned with theoretical computer science papers being too vague to write code, let alone include it. (Marcus Hutter and Juergen Schmidhuber, I'm looking in your general direction here.)
You're having trouble figuring out how to implement AIXI? I saw Marcus write it out as one equation. Perfectly clear what the main loop looks like. All you need is an infinitely fast computer and a halting oracle.
Couldn't you implement a halting oracle given an infinitely fast computer, though?
So, that's one requirement down! We'll have this AIXI thing built any day now.
+5? Yikes! People, it's clear Eliezer_Yudkowsky is joking. There are no infinitely fast computers or halting oracles, and an equation is not the same thing as code, let alone pseudocode.
In any case, AIXI isn't my main complaint in that department. I'm thinking more of
Hutter's fastest shortest algorithm for everything and AIXI-tl; and Schmidhuber's provably globally optimal Goedel machines, speed prior, and ordered optimal problem solver
Toy implementations anytime, guys?
I think that most upvoters got the joke...