Turing Completeness of Finite, Epistemic Programs

Abstract

In this note, we show the class of finite, epistemic programs to be Turing complete. Epistemic programs is a widely used update mechanism used in epistemic logic, where it such are a special type of action models: One which does not contain postconditions.

References in corpus (1)

• Semantic results for ontic and epistemic change

Cited by in corpus (1)

• Convergence, Continuity and Recurrence in Dynamic Epistemic Logic