We provide a "computable counterexample" to the Arrow-Debreu competitive equilibrium existence theorem [2]. In particular, we find an exchange economy in which all components are (Turing) computable, but in which no competitive equilibrium is computable. This result can be interpreted as an...

We present a theoretical view of computation, delineating what types of approximations are possible and what types are impossible. A practical consequence is an approximation algorithm with numerous applications. For several classical problems (finding maximizers, fixed points, equilibrium...

A natural bound on rationality arises from computability:-I can't use a number if I can't compute it, and \hfill\break -I can't use a preference relation or utility function that I can't compute.We assume that all magnitudes (quantities, prices) are computable real numbers, and all relations and...

As a scholarly discipline, criminology in China is growing in stature, maturity and utility. In the short thirty years since 1979, China has successfully established criminology as a scientific field of study with well-defined subjects, recognised scholars and copious research/publications. To...

As a scholarly discipline, criminology in China is growing in stature, maturity and utility. In the short thirty years since 1979, China has successfully established criminology as a scientific field of study with well-defined subjects, recognised scholars and copious research/publications. A...

On 1 July 1997, Hong Kong, a colony (euphemistically called dependent territory) of Britain, was returned to the fold of the motherland, China, as a Special Administration Region, with a high degree of autonomy. Ten years on, we find that the common law system established by the British in Hong...

Many economics problems are maximization or minimization problems, and can be formalized as problems of solving “linear difference systems” of the form <InlineEquation ID="Equ1"> <EquationSource Format="TEX">$r_i-r_j \geqq c_{ij}$</EquationSource> </InlineEquation> and r <Subscript> k </Subscript>-r <Subscript> l </Subscript> c <Subscript> kl </Subscript>, for r-unknowns, with given c-constants. They typically involve strict as well as weak...</subscript></subscript></subscript></equationsource></inlineequation>