Turing Completeness of Finite, Epistemic Programs
classification
💻 cs.FL
cs.LO
keywords
epistemicprogramsfiniteturingusedactionclasscomplete
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.