On Computable Beliefs of Rational Machines

  • Published 2004

Abstract

Traditional decision theory has assumed that agents have complete, consistent, and readily available beliefs and preferences. Obviously, even if an expert system has complete and consistent beliefs, it cannot have them readily available. Moreover, some beliefs about beliefs are not even approximately computable. It is shown that if all players have complete… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics