Iterated Belief Change is the research area that investigates principles for the dynamics of beliefs over (possibly unlimited) many subsequent belief changes. In this paper, we demonstrate how iterated belief change is connected to computation. In particular, we show that iterative belief revision is Turing complete, even under the condition that broadly accepted principles like the Darwiche-Pearl postulates for iterated revision hold.
翻译:长期信仰变化是一个研究领域,研究信仰动态原则相对于(可能无限的)随后的许多信仰变化的原则。 在本文中,我们展示了反复信仰变化是如何与计算相联系的。 特别是,我们显示,反复的信仰改变是图灵式的,即便在类似达尔维切-皮尔(Darwiche-Pearl)关于反复修改的假设等广泛接受的原则的条件下,我们也能证明迭代信仰改变是完整的。