 On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing  1936  Proceedings of the London Mathematical Society 42 (1):230265.details


Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.K. Gödel  1931  Monatshefte für Mathematik 38 (1):173198.details


21 Undecidability and Intractability in Theoretical Physics.Stephen Wolfram  2013  Emergence: Contemporary Readings in Philosophy and Science.details


Epsilonergodicity and the success of equilibrium statistical mechanics.Peter B. M. Vranas  1998  Philosophy of Science 65 (4):688708.details


Statistical explanation and ergodic theory.Lawrence Sklar  1973  Philosophy of Science 40 (2):194212.details


On a simple definition of computable function of a real variable‐with applications to functions of a complex variable.Marian Boykan PourEl & Jerome Caldwell  1975  Mathematical Logic Quarterly 21 (1):119.details


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):161180.details


Why Gibbs Phase Averages Work—The Role of Ergodic Theory.David B. Malament & Sandy L. Zabell  1980  Philosophy of Science 47 (3):339349.details


Computable Functionals.A. Grzegorczyk  1959  Journal of Symbolic Logic 24 (1):5051.details


Physics and Chance.Lawrence Sklar  1995  British Journal for the Philosophy of Science 46 (1):145149.details


Did Poincare really discover chaos? [REVIEW]Matthew W. Parker  1998  Studies in the History and Philosophy of Modern Physics 29 (4):575588.details


The Decision Problem for Entanglement.Wayne C. Myrvold  1997  In Robert S. Cohen, Michael Horne & John Stachel (eds.), Potentiality, Entanglement, and PassionataDistance: Quantum Mechanical Studies for Abner Shimony. Kluwer Academic Publishers. pp. 177190.details

