Turing Completeness of Finite, Epistemic Programs

Dominik Klein; Rasmus K. Rendsvig

Turing Completeness of Finite, Epistemic Programs

Dominik Klein, Rasmus K. Rendsvig

Institut for Kommunikation

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.

Originalsprog	Engelsk
Tidsskrift	arXiv.org
Status	Udgivet - 21 jun. 2017

Adgang til dokumentet

http://arxiv.org/pdf/1706.06845v1

Citationsformater

@article{e6e3bff0b45a41b8a5cca122a3d00856,

title = "Turing Completeness of Finite, Epistemic Programs",

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. ",

keywords = "cs.FL, cs.LO",

author = "Dominik Klein and Rendsvig, {Rasmus K.}",

year = "2017",

month = jun,

day = "21",

language = "English",

journal = "arXiv.org",

}

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 -