Turing Completeness of Finite, Epistemic Programs

Dominik Klein, Rasmus K. Rendsvig

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment