The shutdown problem is the problem of programming an agent so that it behaves useful during normal operation and facilitates a shutdown if and only if the creator wants to shut the agent down. First, we revisit a formalisation of this problem from the literature and we show that solutions are essentially unique. Second, we formally define ad-hoc constructions. Last, we present one trivial ad-hoc construction for the shutdown problem and show that every solution to the shutdown problem must come from an ad-hoc construction, which is to be expected given the uniqueness from the first point. We relate this to non-existence theorems from the literature.

Issue Section:
General Conference: Accepted poster presentations
This content is only available as a PDF.
© 2024 Massachusetts Institute of Technology Published under a Creative Commons Attribution 4.0 International (CC BY 4.0) license
2024
Massachusetts Institute of Technology
This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. For a full description of the license, please visit https://creativecommons.org/licenses/by/4.0/legalcode.
Issue Section:
General Conference: Accepted poster presentations