Switch to: Citations

Add references

You must login to add references.
  1. Simulations, models, and theories: Complex physical systems and their representations.Eric Winsberg - 2001 - Proceedings of the Philosophy of Science Association 2001 (3):S442-.
    Using an example of a computer simulation of the convective structure of a red giant star, this paper argues that simulation is a rich inferential process, and not simply a "number crunching" technique. The scientific practice of simulation, moreover, poses some interesting and challenging epistemological and methodological issues for the philosophy of science. I will also argue that these challenges would be best addressed by a philosophy of science that places less emphasis on the representational capacity of theories (and ascribes (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   51 citations  
  • Simulations, Models, and Theories: Complex Physical Systems and Their Representations.Eric Winsberg - 2001 - Philosophy of Science 68 (S3):S442-S454.
    Using an example of a computer simulation of the convective structure of a red giant star, this paper argues that simulation is a rich inferential process, and not simply a “number crunching” technique. The scientific practice of simulation, moreover, poses some interesting and challenging epistemological and methodological issues for the philosophy of science. I will also argue that these challenges would be best addressed by a philosophy of science that places less emphasis on the representational capacity of theories and more (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   50 citations  
  • Are There Absolutely Unsolvable Problems? Godel's Dichotomy.S. Feferman - 2006 - Philosophia Mathematica 14 (2):134-152.
    This is a critical analysis of the first part of Go¨del’s 1951 Gibbs lecture on certain philosophical consequences of the incompleteness theorems. Go¨del’s discussion is framed in terms of a distinction between objective mathematics and subjective mathematics, according to which the former consists of the truths of mathematics in an absolute sense, and the latter consists of all humanly demonstrable truths. The question is whether these coincide; if they do, no formal axiomatic system (or Turing machine) can comprehend the mathematizing (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  • Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system.Matthew W. Parker - 2003 - Philosophy of Science 70 (2):359-382.
    Some have suggested that certain classical physical systems have undecidable long-term behavior, without specifying an appropriate notion of decidability over the reals. We introduce such a notion, decidability in (or d- ) for any measure , which is particularly appropriate for physics and in some ways more intuitive than Ko's (1991) recursive approximability (r.a.). For Lebesgue measure , d- implies r.a. Sets with positive -measure that are sufficiently "riddled" with holes are never d- but are often r.a. This explicates Sommerer (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Mathematical models: Questions of trustworthiness.Adam Morton - 1993 - British Journal for the Philosophy of Science 44 (4):659-674.
    I argue that the contrast between models and theories is important for public policy issues. I focus especially on the way a mathematical model explains just one aspect of the data.
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   83 citations  
  • On the question of absolute undecidability.Peter Koellner - 2010 - In Kurt Gödel, Solomon Feferman, Charles Parsons & Stephen G. Simpson (eds.), Philosophia Mathematica. Association for Symbolic Logic. pp. 153-188.
    The paper begins with an examination of Gödel's views on absolute undecidability and related topics in set theory. These views are sharpened and assessed in light of recent developments. It is argued that a convincing case can be made for axioms that settle many of the questions undecided by the standard axioms and that in a precise sense the program for large cardinals is a complete success “below” CH. It is also argued that there are reasonable scenarios for settling CH (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  • Computable Functionals.A. Grzegorczyk - 1959 - Journal of Symbolic Logic 24 (1):50-51.
    Direct download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Provability and Truth.Torkel Franzén - 1987
  • Models as Mediators: Perspectives on Natural and Social Science.Mary S. Morgan & Margaret Morrison (eds.) - 1999 - Cambridge University Press.
    Models as Mediators discusses the ways in which models function in modern science, particularly in the fields of physics and economics. Models play a variety of roles in the sciences: they are used in the development, exploration and application of theories and in measurement methods. They also provide instruments for using scientific concepts and principles to intervene in the world. The editors provide a framework which covers the construction and function of scientific models, and explore the ways in which they (...)
     
    Export citation  
     
    Bookmark   350 citations  
  • The World as a Process: Simulations in the Natural and Social Sciences.Stephan Hartmann - 1996 - In Rainer Hegselmann (ed.), Modelling and Simulation in the Social Sciences from the Philosophy of Science Point of View.
    Simulation techniques, especially those implemented on a computer, are frequently employed in natural as well as in social sciences with considerable success. There is mounting evidence that the "model-building era" (J. Niehans) that dominated the theoretical activities of the sciences for a long time is about to be succeeded or at least lastingly supplemented by the "simulation era". But what exactly are models? What is a simulation and what is the difference and the relation between a model and a simulation? (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   77 citations  
  • Deterministic Nonperiodic Flow.Edward Lorenz - 1963 - Journal of Atmospheric Sciences 20 (2):130-148.
    Finite systems of deterministic ordinary nonlinear differential equations may be designed to represent forced dissipative hydrodynamic flow. Solutions of these equations can be identified with trajectories in phase space. For those systems with bounded solutions, it is found that nonperiodic solutions are ordinarily unstable with respect to small modifications, so that slightly differing initial states can evolve into considerably different states. Systems with bounded solutions are shown to possess bounded numerical solutions.A simple system representing cellular convection is solved numerically. All (...)
     
    Export citation  
     
    Bookmark   129 citations  
  • Simulating many-body models in physics: Rigorous results, 'benchmarks', and cross-model justification.Axel Gelfert - unknown
    This paper argues that, for a prospective philosophical analysis of models and simulations to be successful, it must accommodate an account of mathematically rigorous results. Such rigorous results are best thought of as genuinely model-specific contributions, which can neither be deduced from fundamental theory nor inferred from empirical data. Rigorous results often provide new indirect ways of assessing the success of computer simulations of individual models. This is most obvious in cases where rigorous results map different models on to one (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Three concepts of decidability for general subsets of uncountable spaces.Matthew W. Parker - 2003 - Theoretical Computer Science 351 (1):2-13.
    There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The decision problem for entanglement, in: R.S. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Undecidable long-term behavior in classical physics: Foundations, results, and interpretation.Matthew W. Parker - 2005 - Dissertation, University of Chicago
    The behavior of some systems is non-computable in a precise new sense. One infamous problem is that of the stability of the solar system: Given the initial positions and velocities of several mutually gravitating bodies, will any eventually collide or be thrown off to infinity? Many have made vague suggestions that this and similar problems are undecidable: no finite procedure can reliably determine whether a given configuration will eventually prove unstable. But taken in the most natural way, this is trivial. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • The Decision Problem for Entanglement.Wayne C. Myrvold - 1997 - In Robert S. Cohen, Michael Horne & John Stachel (eds.), Potentiality, Entanglement, and Passion-at-a-Distance: Quantum Mechanical Studies for Abner Shimony. Kluwer Academic Publishers. pp. 177--190.