Computable economics. The Arne Ryde memorial lectures. (English) Zbl 1007.91001
Oxford: Oxford University Press. xi, 222 p. (2000).
This is an essay-like monograph proposing a recursion theoretic formalization of economic analysis, called by the author Computable economics. In the introductory chapter he writes that the relevant research program can be realized (p. 14, l. 5b, to p. 16, l. 7a) “… in one of two ways (or in an eclectic combination of the two): either
(a) seek or investigate the economic implications of recursion-theoretic restrictions to the standard primitive concepts of economic analysis; or
(b) go back to one of the nodes of the decision-tree that characterizes the development of the mathematization of economics (cf. Leijonhufvud 1991); e.g. to the nodes at which existence, uniqueness and stability questions were rigorously posed and reconsidered for general economic equilibrium; then try to answer the question recursion-theoretically, rather than set-theoretically or model-theoretically”. Then he declares: “My own inclination is to go the latter way (i.e. (b)), although my limited knowledge and abilities force me to go the former way (i.e. (a)). As a result of these conflicting features, this work is mildly eclectic, dominated by the former method with a few infusions along the latter path.”
The book consists of 10 chapters and an Appendix. The list of references contains about 200 items. The contents of the book is the following:
1) Introduction and Overview; 2) Ideas, Pioneers and Precursors; 3) Computable Rationality; 4) Adaptive behaviour; 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: A Child’s Guide to Elementary Aspects of Computability Theory; References; Author Index; Subject Index.
In Chapter 2 the author names the pioneers and precursors of computable economics: “Rabin (games) [1957], Lewis (games, rationality, equilibria), Spear (learning), and Rustem and Velupillai (rationality) [1990]”. The discussion, summaries and generalizations of their works are found in Chapters 3, 6, 7 and 9. The historical background is well documented and accurately presented.
Mathematics is found in the book, first of all, in the Appendix [from Turing machine computable functions to enumerability and recursive functions and sets]. More mathematics is present also in the Sections: 3.2 The rational economic agent as a Turing machine and 3.3 The nonefectivity of preference generation [choice functions, computability, decidability]; 4.3 A computable basis for the study of trial-and-error processes in rational choice [neural nets]; 5.2 The modern theory of induction and 5.3 Gold’s learning and Solomonoff’s inductive inference [Bayes’ formula exploited]; 6.3 Computable analytic underpinning for the Spear model [functional dynamic equation whose solution can be identified as the rational expectation equilibrium and learned recursively]; 7.3 Rabin’s computable game - and extensions [nonexistence of a winning strategy]; 7.4 Arithmetical games [they are determined]; 8.3 Khachian’s ellipsoid algorithm and the complexity of the policy design [an algorithm for linear programming terminating in polynomial time]. One also finds remarks on: Hahn-Banach theorem, Hilbert’s tenth problem, William of Occam’s razor, dynamical systems.
In the book there are over 160 footnotes. Each chapter and section begins with a motto (or two, altogether almost 50 quotes). After chapter headings we find quotes taken among others from Solow 1954, Rabin 1957, Leibniz 1686/1965, Wittgenstein 1980, Kemeny 1953, Simon 1969, Babbage 1864/1961, Bronowski 1978. Also in the text there is a lot of quotations from references.
The book under review is rich in ideas and problems and may inspire research work of specialists in mathematical economics.
(a) seek or investigate the economic implications of recursion-theoretic restrictions to the standard primitive concepts of economic analysis; or
(b) go back to one of the nodes of the decision-tree that characterizes the development of the mathematization of economics (cf. Leijonhufvud 1991); e.g. to the nodes at which existence, uniqueness and stability questions were rigorously posed and reconsidered for general economic equilibrium; then try to answer the question recursion-theoretically, rather than set-theoretically or model-theoretically”. Then he declares: “My own inclination is to go the latter way (i.e. (b)), although my limited knowledge and abilities force me to go the former way (i.e. (a)). As a result of these conflicting features, this work is mildly eclectic, dominated by the former method with a few infusions along the latter path.”
The book consists of 10 chapters and an Appendix. The list of references contains about 200 items. The contents of the book is the following:
1) Introduction and Overview; 2) Ideas, Pioneers and Precursors; 3) Computable Rationality; 4) Adaptive behaviour; 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: A Child’s Guide to Elementary Aspects of Computability Theory; References; Author Index; Subject Index.
In Chapter 2 the author names the pioneers and precursors of computable economics: “Rabin (games) [1957], Lewis (games, rationality, equilibria), Spear (learning), and Rustem and Velupillai (rationality) [1990]”. The discussion, summaries and generalizations of their works are found in Chapters 3, 6, 7 and 9. The historical background is well documented and accurately presented.
Mathematics is found in the book, first of all, in the Appendix [from Turing machine computable functions to enumerability and recursive functions and sets]. More mathematics is present also in the Sections: 3.2 The rational economic agent as a Turing machine and 3.3 The nonefectivity of preference generation [choice functions, computability, decidability]; 4.3 A computable basis for the study of trial-and-error processes in rational choice [neural nets]; 5.2 The modern theory of induction and 5.3 Gold’s learning and Solomonoff’s inductive inference [Bayes’ formula exploited]; 6.3 Computable analytic underpinning for the Spear model [functional dynamic equation whose solution can be identified as the rational expectation equilibrium and learned recursively]; 7.3 Rabin’s computable game - and extensions [nonexistence of a winning strategy]; 7.4 Arithmetical games [they are determined]; 8.3 Khachian’s ellipsoid algorithm and the complexity of the policy design [an algorithm for linear programming terminating in polynomial time]. One also finds remarks on: Hahn-Banach theorem, Hilbert’s tenth problem, William of Occam’s razor, dynamical systems.
In the book there are over 160 footnotes. Each chapter and section begins with a motto (or two, altogether almost 50 quotes). After chapter headings we find quotes taken among others from Solow 1954, Rabin 1957, Leibniz 1686/1965, Wittgenstein 1980, Kemeny 1953, Simon 1969, Babbage 1864/1961, Bronowski 1978. Also in the text there is a lot of quotations from references.
The book under review is rich in ideas and problems and may inspire research work of specialists in mathematical economics.
Reviewer: Bogdan Choczewski (Kraków)
MSC:
91-02 | Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance |
91B02 | Fundamental topics (basic mathematics, methodology; applicable to economics in general) |
00A69 | General applied mathematics |
03D10 | Turing machines and related notions |
03D15 | Complexity of computation (including implicit computational complexity) |
03D20 | Recursive functions and relations, subrecursive hierarchies |
03D25 | Recursively (computably) enumerable sets and degrees |
03D80 | Applications of computability and recursion theory |
37N40 | Dynamical systems in optimization and economics |
68Q05 | Models of computation (Turing machines, etc.) (MSC2010) |
68Q32 | Computational learning theory |
Keywords:
computability; computational complexity: algorithmic; diophantine; economic models; effective procedures; Turing machines; register machines; recursion theory; recursive functions and sets; rationality; rational: choice; economic agent; expectation equilibrium; theory of induction; learning as induction; overlapping-generation models; decision problems; undecidability; computable games: Rabin’s; arithmetic; linear programming; tâtonnement; dynamical systems; cognitive scienceBiographic References:
Ryde, ArneReferences:
[1] | Hahn, F.: The next hundred years. Economic journal 101, 47-50 (1991) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.