Complexity Beyond Agent-Based Models

Gross, Dominique, Jefferies, David (2001) Complexity Beyond Agent-Based Models. Complexity International, 8 . ISSN 1320-0682. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13641)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.

Abstract

Even if there does not yet exist a generally accepted denition of complexity, there are a number of denitions which serve well for specic purposes. Most of these can be implemented in so-called agent based models. However, authors such as Funtowicz and Ravetz (Funtowicz & Ravetz 1994; 1997) or Rosen (Rosen 1991; 1999) argue that a full understanding of complexity has to go beyond computer models. This article tries to elucidate this by means of two examples

Item Type:	Article
Uncontrolled keywords:	measures of complexity, agent based modelling, genuine novelty, reductionism
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Mark Wheadon
Date Deposited:	24 Nov 2008 17:59 UTC
Last Modified:	05 Nov 2024 09:47 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/13641 (The current URI for this page, for reference purposes)

University of Kent Author Information

Depositors only (login required):

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.