Computability, Complexity and Economics

Alfred Lorn Norman

Computational Economics, 1994, vol. 7, issue 1, 21 pages

Abstract: Herbert Simon advocates that economists should study procedural rationality instead of substantive rationality. One approach for studying procedural rationality is to consider algorithmic representations of procedures, which can then be studied using the concepts of computability and complexity. For some time, game theorists have considered the issue of computability and have employed automata to study bounded rationality. Outside game theory, very little research has been performed. Very simple examples of the traditional economic optimization models can require transfinite computations. The impact of procedural rationality on economics depends on the computational resources available to economic agents. Citation Copyright 1994 by Kluwer Academic Publishers.

Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kap:compec:v:7:y:1994:i:1:p:1-21

Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/10614/PS2

Access Statistics for this article

Computational Economics is currently edited by Hans Amman

More articles in Computational Economics from Springer, Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().