Computable and computational complexity theoretic bases for Herbert Simon's cognitive behavioral economics

  • Velupillai K
  • Kao Y
  • 16

    Readers

    Mendeley users who have this article in their library.
  • 3

    Citations

    Citations of this article.

Abstract

This paper aims to interpret and formalize Herbert Simon's cognitive notions of bounded rationality, satisficing and heuristics in terms of computability theory and computational complexity theory. Simon's theory of human problem solving is analyzed in the light of Turing's work on Solvable and Unsolvable Problems. It is suggested here that bounded rationality results from the fact that the deliberations required for searching computationally complex spaces exceed the actual complexity that human beings can handle. The immediate consequence is that satisficing becomes the general criterion of decision makers and heuristics are the procedures used for achieving their goals. In such decision problems, it is demonstrated that bounded rationality and satisficing are more general than orthodox, non-cognitive, Olympian rationality and optimization, respectively, and not the other way about. © 2013 Elsevier B.V.

Author-supplied keywords

  • Bounded rationality
  • Computability
  • Computational complexity
  • Heuristics
  • Satisficing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • K. Vela Velupillai

  • Ying Fang Kao

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free