deceptive alignment that I like are and always have been about parameterizations rather than functions.
How can this be true, when you e.g. say there’s “only one saint”? That doesn’t make any sense with parameterizations due to internal invariances; there are uncountably many “saints” in parameter-space (insofar as I accept that frame, which I don’t really but that’s not the point here). I’d expect you to raise that as an obvious point in worlds where this really was about parameterizations.
And, as you’ve elsewhere noted, we don’t know enough about parameterizations to make counting arguments over them. So how are you doing that?
How can this be true, when you e.g. say there’s “only one saint”? That doesn’t make any sense with parameterizations due to internal invariances; there are uncountably many saints.
Because it was the transcript of a talk? I was trying to explain an argument at a very high level. And there’s certainly not uncountably many; in the infinite bitstring case there would be countably many, though usually I prefer priors that put caps on total computation such that there are only finitely many.
I’d expect you to raise that as an obvious point in worlds where this really was about parameterizations.
I don’t really appreciate the psychoanalysis here. I told you what I thought and think, and I have far more evidence about that than you do.
And, as you’ve elsewhere noted, we don’t know enough about parameterizations to make counting arguments over them. So how are you doing that?
As I’ve said, I usually try to take whatever the most realistic prior is that we can reason about at a high-level, e.g. a circuit prior or a speed prior.
How can this be true, when you e.g. say there’s “only one saint”? That doesn’t make any sense with parameterizations due to internal invariances; there are uncountably many “saints” in parameter-space (insofar as I accept that frame, which I don’t really but that’s not the point here). I’d expect you to raise that as an obvious point in worlds where this really was about parameterizations.
And, as you’ve elsewhere noted, we don’t know enough about parameterizations to make counting arguments over them. So how are you doing that?
Because it was the transcript of a talk? I was trying to explain an argument at a very high level. And there’s certainly not uncountably many; in the infinite bitstring case there would be countably many, though usually I prefer priors that put caps on total computation such that there are only finitely many.
I don’t really appreciate the psychoanalysis here. I told you what I thought and think, and I have far more evidence about that than you do.
As I’ve said, I usually try to take whatever the most realistic prior is that we can reason about at a high-level, e.g. a circuit prior or a speed prior.