Turing Completeness of Finite, Epistemic Programs
Research output: Contribution to journal › Journal article › Research
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.
| Original language | English |
|---|---|
| Journal | arXiv.org |
| Publication status | Published - 21 Jun 2017 |
- cs.FL, cs.LO
Research areas
ID: 214014639