Turing Completeness of Finite, Epistemic Programs
Formal Languages and Automata Theory
2017-06-22 v1 Logic in Computer Science
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.
Cite
@article{arxiv.1706.06845,
title = {Turing Completeness of Finite, Epistemic Programs},
author = {Dominik Klein and Rasmus K. Rendsvig},
journal= {arXiv preprint arXiv:1706.06845},
year = {2017}
}