Turing Completeness of Finite, Epistemic Programs
Research output: Contribution to journal › Journal article › Research
Standard
Turing Completeness of Finite, Epistemic Programs. / Klein, Dominik; Rendsvig, Rasmus K.
In: arXiv.org, 21.06.2017.Research output: Contribution to journal › Journal article › Research
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Turing Completeness of Finite, Epistemic Programs
AU - Klein, Dominik
AU - Rendsvig, Rasmus K.
PY - 2017/6/21
Y1 - 2017/6/21
N2 - 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.
AB - 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.
KW - cs.FL
KW - cs.LO
M3 - Journal article
JO - arXiv.org
JF - arXiv.org
ER -
ID: 214014639