Computable Economics
K. Vela Velupillai · 2000
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.