Switch to: Citations

Add references

You must login to add references.
  1. Can agent‐based models assist decisions on large‐scale practical problems? A philosophical analysis.Dominique Gross & Roger Strand - 2000 - Complexity 5 (6):26-33.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • The Role Of Models In Computer Science.James H. Fetzer - 1999 - The Monist 82 (1):20-36.
    Taking Brian Cantwell Smith’s study, “Limits of Correctness in Computers,” as its point of departure, this article explores the role of models in computer science. Smith identifies two kinds of models that play an important role, where specifications are models of problems and programs are models of possible solutions. Both presuppose the existence of conceptualizations as ways of conceiving the world “in certain delimited ways.” But high-level programming languages also function as models of virtual (or abstract) machines, while low-level programming (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Philosophical aspects of program verification.James H. Fetzer - 1991 - Minds and Machines 1 (2):197-216.
    A debate over the theoretical capabilities of formal methods in computer science has raged for more than two years now. The function of this paper is to summarize the key elements of this debate and to respond to important criticisms others have advanced by placing these issues within a broader context of philosophical considerations about the nature of hardware and of software and about the kinds of knowledge that we have the capacity to acquire concerning their performance.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Agent‐based computational models and generative social science.Joshua M. Epstein - 1999 - Complexity 4 (5):41-60.
    Download  
     
    Export citation  
     
    Bookmark   54 citations  
  • Program verification: the very idea.James H. Fetzer - 1988 - Communications of the Acm 31 (9):1048--1063.
    The notion of program verification appears to trade upon an equivocation. Algorithms, as logical structures, are appropriate subjects for deductive verification. Programs, as causal models of those structures, are not. The success of program verification as a generally applicable and completely reliable method for guaranteeing program performance is not even a theoretical possibility.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • Advancing the art of simulation in the social sciences.Robert Axelrod - 1997 - Complexity 3 (2):16-22.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • The Structure and Logic of Interdisciplinary Research in Agent-Based Social Simulation.Nuno David, Maria Marietto, Jaime Sichman & Helder Coelho - 2004 - Journal of Artificial Societies and Social Simulation 7 (3).
    This article reports an exploratory survey of the structure of interdisciplinary research in Agent-Based Social Simulation. One hundred and ninety six researchers participated in the survey completing an on-line questionnaire. The questionnaire had three distinct sections, a classification of research domains, a classification of models, and an inquiry into software requirements for designing simulation platforms. The survey results allowed us to disambiguate the variety of scientific goals and modus operandi of researchers with a reasonable level of detail, and to identify (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations