How simulations fail
نویسندگان
چکیده
The problem with simulations is that they are doomed to succeed.’ So runs a common criticism of simulations—that they can be used to ‘prove’ anything and are thus of little or no scientific value. While this particular objection represents a minority view, especially among those who work with simulations in a scientific context, it raises a difficult question: what standards should we use to differentiate a simulation that fails from one that succeeds? In this paper we build on a structural analysis of simulation developed in previous work to provide an evaluative account of the variety of ways in which simulations do fail. We expand the structural analysis in terms of the relationship between a simulation and its real-world target emphasizing the important role of aspects intended to correspond and also those specifically intended not to correspond to reality. The result is an outline both of the ways in which simulations can fail and the scientific importance of those various forms of failure.
منابع مشابه
Experimental Evidence Showing That Stochastic Subspace Identification Methods May Fail*
It is known that certain popular stochastic subspace identification methods may fail for theoretical reasons related to positive realness. In fact, these algorithms are implicitly based on the assumption that the positive and algebraic degrees of a certain estimated covariance sequence coincide. In this paper, we describe how to generate data with the property that this condition is not satisfi...
متن کاملarXiv : hep - th / 9310137 v 2 28 Feb 1995 Percolation on Strings and the Cover - up of the c = 1 Disaster
We study percolation on the worldsheets of string theory for c = 0, 1/2, 1 and 2. For c < 1 we find that critical exponents measured from simulations agree quite well with the theoretical values. For c = 1 we show how log corrections determined from the exact solution reconcile numerical results with the KPZ predictions. We extend this analysis to the large c regime and estimate how finite-size...
متن کاملFailure-sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency
The abstract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iteratively to construct efficient simulations of pram algorithms on failureprone prams. Such use of Write-All in simulations is abstracted in terms of the iterative Write-All problem. The efficiency of the algorithmi...
متن کاملThermodynamical properties of the ICM from hydrodynamical simulations
Modern hydrodynamical simulations offer nowadays a powerful means to trace the evolution of the X–ray properties of the intra–cluster medium (ICM) during the cos-mological history of the hierarchical build up of galaxy clusters. In this paper we review the current status of these simulations and how their predictions fare in reproducing the most recent X–ray observations of clusters. After brie...
متن کاملAn analysis of head impact severity in simulations of collisions between pedestrians and SUVs/work utility vehicles, and sedans.
OBJECTIVE To describe the determinants of the severity of the head kinematics of a pedestrian when struck by common sport utility vehicles (SUV) and work utility vehicles (WUVs) to assess how effective assessment protocols are in assessing injury risk for SUVs and work utilities. METHODS Three hundred twenty-four simulations of pedestrian collisions with SUVs, work utility vehicles, and sedan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Synthese
دوره 190 شماره
صفحات -
تاریخ انتشار 2013