Iterated Belief Change, Computationally
Kai Sauerwald, Christoph Beierle · 2022
This paper considers belief change in the Darwiche-Pearl framework. We demonstrate that iterative belief revision is Turing complete by showing how revision operators over ranking functions can simulate every Turing machine. Our result holds even under the condition that the broadly accepted Darwiche-Pearl postulates for iterated revision hold.