If you start with an AI design parameterized by preference, you are not going to enumerate all programs, only a small fraction of programs that have the specific form of your AI with some preference, and so for a given arbitrary program there will be no match.
When I said “all possible implementations of all possible utility functions”, I meant to include flawed implementations. But then two different utility functions might map onto the same physical object, so we’d also need a theory of implementation flaws that tells us, given two implementations of a utility function, which is more flawed.
When I said “all possible implementations of all possible utility functions”, I meant to include flawed implementations. But then two different utility functions might map onto the same physical object, so we’d also need a theory of implementation flaws that tells us, given two implementations of a utility function, which is more flawed.
This is WAY too hand-wavy an explanation for “in principle, we can go backwards” (from a system to its preference). I believe that in principle, we can, but not via injecting fuzziness of “implementation flaws”.
When I said “all possible implementations of all possible utility functions”, I meant to include flawed implementations. But then two different utility functions might map onto the same physical object, so we’d also need a theory of implementation flaws that tells us, given two implementations of a utility function, which is more flawed.
This is WAY too hand-wavy an explanation for “in principle, we can go backwards” (from a system to its preference). I believe that in principle, we can, but not via injecting fuzziness of “implementation flaws”.