Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Computability Constructivity And Complexity In Economic Theory PDF full book. Access full book title Computability Constructivity And Complexity In Economic Theory.
| Author | : K. Vela Velupillai |
| Publisher | : |
| Total Pages | : 230 |
| Release | : 2004 |
| Genre | : Mathematik / Mathematische Ökonomie / Computer / Wissenschaftliche Methode / Wirtschaftstheorie / Theorie |
| ISBN | : |
| Author | : K. Vela Velupillai |
| Publisher | : Wiley-Blackwell |
| Total Pages | : 336 |
| Release | : 2005-05-13 |
| Genre | : Business & Economics |
| ISBN | : 9781405130783 |
This cutting-edge collection of essays develops an economic theory based on the mathematics of the digital computer. A cutting-edge collection of essays, which develops an economic theory based on the mathematics of the digital computer. Proposes a wholly different mathematical foundation for economic theory and applied economics. The contributors supply explicit formalizations and applications to traditional issues in economic analysis. Each chapter presents new theoretical perspectives and results, and novel conceptual definitions.
| Author | : K. Vela Velupillai |
| Publisher | : Routledge |
| Total Pages | : 513 |
| Release | : 2012-07-26 |
| Genre | : Business & Economics |
| ISBN | : 1134253370 |
Computable Foundations for Economics is a unified collection of essays, some of which are published here for the first time and all of which have been updated for this book, on an approach to economic theory from the point of view of algorithmic mathematics. By algorithmic mathematics the author means computability theory and constructive mathematics. This is in contrast to orthodox mathematical economics and game theory, which are formalised with the mathematics of real analysis, underpinned by what is called the ZFC formalism, i.e., set theory with the axiom of choice. This reliance on ordinary real analysis and the ZFC system makes economic theory in its current mathematical mode completely non-algorithmic, which means it is numerically meaningless. The book provides a systematic attempt to dissect and expose the non-algorithmic content of orthodox mathematical economics and game theory and suggests a reformalization on the basis of a strictly rigorous algorithmic mathematics. This removes the current schizophrenia in mathematical economics and game theory, where theory is entirely divorced from algorithmic applicability – for experimental and computational exercises. The chapters demonstrate the uncomputability and non-constructivity of core areas of general equilibrium theory, game theory and recursive macroeconomics. The book also provides a fresh look at the kind of behavioural economics that lies behind Herbert Simon’s work, and resurrects a role for the noble classical traditions of induction and verification, viewed and formalised, now, algorithmically. It will therefore be of particular interest to postgraduate students and researchers in algorithmic economics, game theory and classical behavioural economics.
| Author | : Vasco Brattka |
| Publisher | : Springer Nature |
| Total Pages | : 427 |
| Release | : 2021-06-04 |
| Genre | : Computers |
| ISBN | : 3030592340 |
Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by algorithmic means? Nowadays this theory has many different facets that embrace topics from computability theory, algorithmic randomness, computational complexity, dynamical systems, fractals, and analog computers, up to logic, descriptive set theory, constructivism, and reverse mathematics. In recent decades computable analysis has invaded many branches of analysis, and researchers have studied computability and complexity questions arising from real and complex analysis, functional analysis, and the theory of differential equations, up to (geometric) measure theory and topology. This handbook represents the first coherent cross-section through most active research topics on the more theoretical side of the field. It contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. All chapters are written by leading experts working at the cutting edge of the respective topic. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, and a wealth of information and references that will help them to navigate the modern research literature in this field.
| Author | : Stefano Zambelli |
| Publisher | : Routledge |
| Total Pages | : 464 |
| Release | : 2010-02-25 |
| Genre | : Business & Economics |
| ISBN | : 1135272530 |
The book contains thirty original articles dealing with important aspects of theoretical as well as applied economic theory. While the principal focus is on: the computational and algorithmic nature of economic dynamics; individual as well as collective decision process and rational behavior, some contributions emphasize also the importance of classical recursion theory and constructive mathematics for dynamical systems, business cycles theories, growth theories, and others are in the area of history of thought, methodology and behavioural economics. The contributors range from Nobel Laureates to the promising new generation of innovative thinkers. This volume is also a Festschrift in honour of Professor Kumaraswamy Vela Velupillai, the founder of Computable Economics, a growing field of research where important results stemming from classical recursion theory and constructive mathematics are applied to economic theory. The aim and hope is to provide new tools for economic modelling. This book will be of particular appeal to postgraduate students and scholars in one or more of the following fields: computable economics, business cycles, macroeconomics, growth theories, methodology, behavioural economics, financial economics, experimental and agent based economics. It might be also of importance to those interested on the general theme of algorithmic foundations for social sciences.
| Author | : Jacques Dubucs |
| Publisher | : Springer |
| Total Pages | : 223 |
| Release | : 2014-08-27 |
| Genre | : Philosophy |
| ISBN | : 9401792178 |
Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing’s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics. This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability’s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic.
| Author | : Stefano Zambelli |
| Publisher | : Routledge |
| Total Pages | : 812 |
| Release | : 2010-02-25 |
| Genre | : Business & Economics |
| ISBN | : 1135272522 |
The book contains thirty original articles dealing with important aspects of theoretical as well as applied economic theory. While the principal focus is on: the computational and algorithmic nature of economic dynamics; individual as well as collective decision process and rational behavior, some contributions emphasize also the importance of classical recursion theory and constructive mathematics for dynamical systems, business cycles theories, growth theories, and others are in the area of history of thought, methodology and behavioural economics. The contributors range from Nobel Laureates to the promising new generation of innovative thinkers. This volume is also a Festschrift in honour of Professor Kumaraswamy Vela Velupillai, the founder of Computable Economics, a growing field of research where important results stemming from classical recursion theory and constructive mathematics are applied to economic theory. The aim and hope is to provide new tools for economic modelling. This book will be of particular appeal to postgraduate students and scholars in one or more of the following fields: computable economics, business cycles, macroeconomics, growth theories, methodology, behavioural economics, financial economics, experimental and agent based economics. It might be also of importance to those interested on the general theme of algorithmic foundations for social sciences.
| Author | : Stefano Zambelli |
| Publisher | : John Wiley & Sons |
| Total Pages | : 352 |
| Release | : 2012-01-17 |
| Genre | : Business & Economics |
| ISBN | : 1118300432 |
Nonlinearity, Complexity and Randomness in Economics presents a variety of papers by leading economists, scientists, and philosophers who focus on different aspects of nonlinearity, complexity and randomness, and their implications for economics. A theme of the book is that economics should be based on algorithmic, computable mathematical foundations. Features an interdisciplinary collection of papers by economists, scientists, and philosophers Presents new approaches to macroeconomic modelling, agent-based modelling, financial markets, and emergent complexity Reveals how economics today must be based on algorithmic, computable mathematical foundations
| Author | : K. Vela Velupillai |
| Publisher | : |
| Total Pages | : 0 |
| Release | : 2015 |
| Genre | : |
| ISBN | : |
An overview of the varieties of mathematics that underpin the functioning of a computer is attempted in this paper. Against the backdrop of such an overview, the question is posed whether, and to what extent, the economist has respected these varieties of mathematics in posing economic questions and seeking answers via it, i.e. the computer. The answers are not particularly edifying for the economist.
| Author | : Kenneth R. Mount |
| Publisher | : Cambridge University Press |
| Total Pages | : 251 |
| Release | : 2002-06-24 |
| Genre | : Business & Economics |
| ISBN | : 1139433733 |
This book presents a model of computing and a measure of computational complexity which are intended to facilitate analysis of computations performed by people, machines, or a mixed system of people and machines. The model is designed to apply directly to models of economic theory, which typically involve continuous variables and smooth functions, without requiring analysis of approximations. The model permits analysis of the feasibility and complexity of the calculations required of economic agents in order for them to arrive at their decisions. The treatment contains applications of the model to game theory and economics, including comparison of the complexities of different solution concepts in certain bargaining games, and the trade-off between communication and computation in an example of an Edgeworth Box economy.
