Computable Economics
The Arne Ryde Memorial Lectures
Velupillai, K.,
Department of Economics and the Centre for Experimental and Computational Economics, University of Trento, Italy, and Senior Professor of Economics at the Madras School of Economics, India
Print publication date: 2000
Published to Oxford Scholarship Online: November 2003 Print ISBN-13: 978-0-19-829527-3 doi:10.1093/0198295278.001.0001 |
|
|
Abstract:
In a discipline such as economics, increasingly devoted to its computational content, the mathematical underpinnings of the computability assumptions of economic fundamentals have not been investigated systematically or reasonably exhaustively. In this book, such an attempt is made for the first time. Choice theory, adaptively rational behaviour, induction, learning, arithmetical games, computational complexity of decision processes, growth theory, and the theory of economic fluctuations are given recursion theoretic (i.e, computable) interpretations. Economic theoretic questions, posed recursion theoretically, lead to answers that are ambiguous: undecidable choices, uncomputable learning processes, algorithmically unplayable games, etc., become standard answers. The book also claims that a recursion theoretic formalization of economic analysis makes the subject intrinsically inductive and computational.
Keywords: adaptive behaviour, arithmetical games, computability, computational complexity, economic theory, growth theory, induction, learning, recursion theory, undecidability Table of Contents
Preface
1.
Introduction and Overview
2.
Ideas, Pioneers, and Precursors
3.
Computable Rationality
4.
Adaptive Behavior
5.
The Modern Theory of Induction
6.
Learning in a Computable Setting
7.
Effective Playability in Arithmetical Games
8.
Notes on Computational Complexity
9.
Explorations in Computable Economics
10.
Conclusions: Reflections and Hopes
Appendix
Bibliography
Index
|
|
|
|
|