= 27d567bc2d48d9f40e9ccc20ea370b15)
jimrandomh comments on Depth-based supercontroller objectives, take 2 - LessWrong
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 (21)
I finally figured out what this does.
It takes h, applies an iterated hashing/key-stretching style function to it, and tiles the universe with the result.
Sorry.
Yeah, something like that. "Make the state of the universe such that it's much easier to compute knowing h than without h" doesn't mean that the computation will use any interesting features of h, it could just be key-stretching.
Could you flesh this out? I'm not familiar with key-stretching.
A pretty critical point is whether or not the hashed value is algorithmically random. The depth measure has the advantage of picking over all permissible starting conditions without having to run through each one. So it's not exactly analogous to a brute force attack. So for the moment I'm not convinced on this argument.
Maybe. Can you provide an argument for that?
As stated, that wouldn't maximize g, since applying the hash function once and tiling would cap the universe at finite depth. Tiling doesn't make any sense.
I don't think it's literally tiling. More hash stretching all the way.
I had a hazy sense of that direction of thing being the most likely actual result. Thanks for putting your finger on it for me.