Representing the knowledge of Turing machines
type: Item
instance of: scholarly article
title: Representing the knowledge of Turing machines
zbMATH Open document ID: 0799.03028
DOI: 10.1007/BF01079208
author: Hyun Song Shin
author: Timothy Williamson
published in: Theory and Decision
publication date: 1994-08-16T00:00:00Z
Mathematics Subject Classification ID: 03B60
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 614194
zbMATH Keywords: consistency
zbMATH Keywords: computability
zbMATH Keywords: knowledge
zbMATH Keywords: ignorance
zbMATH Keywords: Turing machine
zbMATH Keywords: epistemic logic S4
MaRDI profile type: Publication
cites work: The Structure of Nash Equilibrium in Repeated Games with Finite Automata
cites work: Agreeing to disagree
cites work: Correlated Equilibrium as an Expression of Bayesian Rationality
cites work: Transitivity follows from Dummett's axiom
cites work: Q4845309
cites work: Q4196401
cites work: Q4052072
cites work: Rationality, Computability, and Nash Equilibrium
cites work: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
cites work: Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
cites work: On the logic of common belief and common knowledge
cites work: Epistemic theories and the interpretation of Gödel's incompleteness theorems
cites work: Extensions of some theorems of Gödel and Church
cites work: Finite automata play the repeated prisoner's dilemma
cites work: Q5826088
description: scientific article; zbMATH DE number 614194