Why is economics not a complex systems science?

The article argues that economics will have to become a complex systems science before economists can comfortably incorporate institutionalist and evolutionary economics into mainstream theory. The article compares the complex adaptive system of John Foster with that of standard economic theory and illustrates the difference through an examination of familiar production function. The place of neoclassical, Keynesian economics in complex systems is considered. The article concludes that convincing, multiple models have been made possible by the increase in widely available computing power available.

Liberal Democracy and the Inferior 'Other'Other’: Could the peace liberal democracy promises to bring not extend to ‘Others’?

Advocates of liberal democracy argue that its principles and practices contribute directly to peace (at both inter-state and domestic levels). They rely on ideals such as the rule of law, institutional checks and balances on power, an ethos of tolerance, and free market economics to deliver the liberal peace. Liberals, however, overlook three important features embedded in the construction of liberal democracy which can serve to facilitate political violence: 1) the fixed and thus non-negotiable nature of liberal democracy’s core principles, 2) the inferior manner in which it conceives ‘Other’ social orders that do not share its core principles, and 3) the urge to proselytise Others. Together, these constitutive qualities can facilitate moves by leaders of Other groups to argue that liberal democracy threatens ‘their’ preferred identity, and thus its promised peaceful outcomes can be put in doubt.

Termination of real-time programs: Definitely, definitely not, or maybe

Real-time control programs are often used in contexts where (conceptually) they run forever. Repetitions within such programs (or their specifications) may either (i) be guaranteed to terminate, (ii) be guaranteed to never terminate (loop forever), or (iii) may possibly terminate. In dealing with real-time programs and their specifications, we need to be able to represent these possibilities, and define suitable refinement orderings. A refinement ordering based on Dijkstra's weakest precondition only copes with the first alternative. Weakest liberal preconditions allow one to constrain behaviour provided the program terminates, which copes with the third alternative to some extent. However, neither of these handles the case when a program does not terminate. To handle this case a refinement ordering based on relational semantics can be used. In this paper we explore these issues and the definition of loops for real-time programs as well as corresponding refinement laws.