Article ID: | iaor2005366 |
Country: | United States |
Volume: | 142 |
Issue: | 2/3 |
Start Page Number: | 521 |
End Page Number: | 543 |
Publication Date: | Oct 2003 |
Journal: | Applied Mathematics and Computation |
Authors: | Voutsadakis G. |
Threshold agent networks (TANs), a discretized version of threshold or neural networks, are proposed as alternative platforms to sequential dynamical systems for modelling computer simulations. It is argued that each model has its own advantages and disadvantages compared to the other and the choice on each occasion should depend on the particular characteristics of the application at hand. Some results on the expressive power and the limitations of TANs are presented. Finally, equivalence classes of TANs that are introduced based on characteristics of their state spaces are studied in detail and upper bounds are given on their cardinalities.