Switch to: Citations

Add references

You must login to add references.
  1. On a Simple Definition of Computable Function of a Real Variable‐with Applications to Functions of a Complex Variable.Marian Boykan Pour-El & Jerome Caldwell - 1975 - Mathematical Logic Quarterly 21 (1):1-19.
  • Epsilon-Ergodicity and the Success of Equilibrium Statistical Mechanics.Peter B. M. Vranas - 1998 - Philosophy of Science 65 (4):688-708.
    Why does classical equilibrium statistical mechanics work? Malament and Zabell (1980) noticed that, for ergodic dynamical systems, the unique absolutely continuous invariant probability measure is the microcanonical. Earman and Rédei (1996) replied that systems of interest are very probably not ergodic, so that absolutely continuous invariant probability measures very distant from the microcanonical exist. In response I define the generalized properties of epsilon-ergodicity and epsilon-continuity, I review computational evidence indicating that systems of interest are epsilon-ergodic, I adapt Malament and Zabell’s (...)
    Direct download (7 more)  
    Export citation  
    Bookmark   37 citations  
  • Why Gibbs Phase Averages Work—The Role of Ergodic Theory.David B. Malament & Sandy L. Zabell - 1980 - Philosophy of Science 47 (3):339-349.
    We propose an "explanation scheme" for why the Gibbs phase average technique in classical equilibrium statistical mechanics works. Our account emphasizes the importance of the Khinchin-Lanford dispersion theorems. We suggest that ergodicity does play a role, but not the one usually assigned to it.
    Direct download (7 more)  
    Export citation  
    Bookmark   45 citations  
  • Statistical Explanation and Ergodic Theory.Lawrence Sklar - 1973 - Philosophy of Science 40 (2):194-212.
    Some philosphers of science of an empiricist and pragmatist bent have proposed models of statistical explanation, but have then become sceptical of the adequacy of these models. It is argued that general considerations concerning the purpose of function of explanation in science which are usually appealed to by such philosophers show that their scepticism is not well taken; for such considerations provide much the same rationale for the search for statistical explanations, as these philosophers have characterized them, as they do (...)
    Direct download (9 more)  
    Export citation  
    Bookmark   41 citations  
  • On Computable Numbers, with an Application to the N Tscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
  • 21 Undecidability and Intractability in Theoretical Physics.Stephen Wolfram - 2013 - Emergence: Contemporary Readings in Philosophy and Science.
    This chapter explores some fundamental consequences of the correspondence between physical process and computations. Most physical questions may be answerable only through irreducible amounts of computation. Those that concern idealized limits of infinite time, volume, or numerical precision can require arbitrarily long computations, and so be considered formally undecidable. The behavior of a physical system may always be calculated by simulating explicitly each step in its evolution. Much of theoretical physics has, however, been concerned with devising shorter methods of calculation (...)
    Direct download (2 more)  
    Export citation  
    Bookmark   21 citations  
  • Physics and Chance.Lawrence Sklar - 1995 - British Journal for the Philosophy of Science 46 (1):145-149.
    Statistical mechanics is one of the crucial fundamental theories of physics, and in his new book Lawrence Sklar, one of the pre-eminent philosophers of physics, offers a comprehensive, non-technical introduction to that theory and to attempts to understand its foundational elements. Among the topics treated in detail are: probability and statistical explanation, the basic issues in both equilibrium and non-equilibrium statistical mechanics, the role of cosmology, the reduction of thermodynamics to statistical mechanics, and the alleged foundation of the very notion (...)
    Export citation  
    Bookmark   137 citations  
  • Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.K. Gödel - 1931 - Monatshefte für Mathematik 38 (1):173--198.
    Export citation  
    Bookmark   217 citations  
  • Laplace's Demon Consults an Oracle: The Computational Complexity of Prediction.Itamar Pitowsky - 1996 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 27 (2):161-180.
  • Did Poincare Really Discover Chaos? [REVIEW]Matthew W. Parker - 1998 - Studies in the History and Philosophy of Modern Physics 29 (4):575-588.
  • Computable Functionals.A. Grzegorczyk - 1959 - Journal of Symbolic Logic 24 (1):50-51.
    Direct download  
    Export citation  
    Bookmark   23 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.