Poincaré, Heisenberg, Gödel. Some limits of scientific knowledge. Fernando Sols Universidad Complutense de Madrid

Similar documents
Uncertainty, incompleteness, chance, and design

The Legacy of Hilbert, Gödel, Gentzen and Turing

The Limit of Humanly Knowable Mathematical Truth

The roots of computability theory. September 5, 2016

The Search for the Perfect Language

Computation. Some history...

Lecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem. Michael Beeson

Epistemological and Computational Constraints of Simulation Support for OR Questions

CISC 876: Kolmogorov Complexity

The Philosophy of Quantum Mechanics (Handout Eight) between the microphysical and the macrophysical. The macrophysical world could be understood

Quantum reality. Syksy Räsänen University of Helsinki, Department of Physics and Helsinki Institute of Physics

Great Theoretical Ideas

Understanding Computation

Lecture 13: Foundations of Math and Kolmogorov Complexity

Quantum Mechanics: Interpretation and Philosophy

Turing Centenary Lecture

Computability Theory

On some Metatheorems about FOL

Hilbert and the concept of axiom

COPENHAGEN INTERPRETATION:

228 My God - He Plays Dice! Schrödinger s Cat. Chapter 28. This chapter on the web informationphilosopher.com/problems/scrodingerscat

Introduction to Turing Machines

A Little History Incompleteness The First Theorem The Second Theorem Implications. Gödel s Theorem. Anders O.F. Hendrickson

226 My God, He Plays Dice! Entanglement. Chapter This chapter on the web informationphilosopher.com/problems/entanglement

Gödel s Incompleteness Theorem. Overview. Computability and Logic

How does it work? QM describes the microscopic world in a way analogous to how classical mechanics (CM) describes the macroscopic world.

CS 275 Automata and Formal Language Theory

Introduction to Bell s theorem: the theory that solidified quantum mechanics

Models. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation

Institute for Applied Information Processing and Communications (IAIK) Secure & Correct Systems. Decidability

Gödel s Incompleteness Theorem. Overview. Computability and Logic

Proton and Electron Mass Determination. S. Reucroft * and E. G. H. Williams ThinkIncubate, Inc., Wellesley, Mass., USA.

Steeple #3: Goodstein s Theorem (glimpse only!)

A philosopher s look at Pauli s exclusion principle. Michela Massimi Dept. of Science and Technology Studies University College London

General Physical Chemistry II

COMPUTING THE BUSY BEAVER FUNCTION

Popper School Methodological Disproof of Quantum Logic

Gödel s Theorem: Limits of logic and computation

CS 275 Automata and Formal Language Theory

CS154, Lecture 12: Kolmogorov Complexity: A Universal Theory of Data Compression

Quantum Entanglement, Bell s Theorem, and Reality

Leibniz s Ultimate Theory Soshichi Uchii

Informal Statement Calculus


Enter Heisenberg, Exit Common Sense

Decidability: Church-Turing Thesis

Hilbert s problems, Gödel, and the limits of computation

ON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM. Turing 1936

Creative Objectivism, a powerful alternative to Constructivism

Hugh Everett III s Many Worlds

Decidable Languages - relationship with other classes.

CS 301. Lecture 17 Church Turing thesis. Stephen Checkoway. March 19, 2018

CSCI3390-Lecture 6: An Undecidable Problem

Einstein-Podolsky-Rosen paradox and Bell s inequalities

17.1 The Halting Problem

Leibniz, Randomness & the Halting Probability

Lecture 2: What is Proof?

3/10/11. Which interpreta/on sounds most reasonable to you? PH300 Modern Physics SP11

Complexity, Undecidability and Tilings. Chaim Goodman-Strauss Univ Arkansas

PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2

Church s undecidability result

The mystery of the zero point

Other Problems in Philosophy and Physics

Emergent proper+es and singular limits: the case of +me- irreversibility. Sergio Chibbaro Institut d Alembert Université Pierre et Marie Curie

Closing the Debates on Quantum Locality and Reality: EPR Theorem, Bell's Theorem, and Quantum Information from the Brown-Twiss Vantage

about Quantum Physics Bill Poirier MVJS Mini-Conference Lawrence Hall of Science July 9, 2015

Decision Problems with TM s. Lecture 31: Halting Problem. Universe of discourse. Semi-decidable. Look at following sets: CSCI 81 Spring, 2012

Problems with/failures of QM

Bell s Theorem 1964 Local realism is in conflict with quantum mechanics

arxiv:quant-ph/ v2 2 May 2002

Phil Notes #7: Time Travel

Logical independence of imaginary and complex numbers in Elementary Algebra

EPR Paradox and Bell s Inequality

A mathematician sees room for miracles. July 2009 (minor typos fixed 2/2010) Edward Ordman ordman.net Comments requested

The Mysteries of Quantum Mechanics

The hybrid-epistemic model of quantum mechanics and the solution to the measurement problem

MthEd/Math 300 Williams Fall 2011 Midterm Exam 3

Lecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem

Physics. Light Quanta

Philosophies of Mathematics. The Search for Foundations

Gödel in class. Achim Feldmeier Brno - Oct 2010

The Arithmetical Hierarchy

CST Part IB. Computation Theory. Andrew Pitts

Quantum Mechanics as Reality or Potentiality from A Psycho-Biological Perspective

Automata & languages. A primer on the Theory of Computation. Laurent Vanbever. ETH Zürich (D-ITET) October,

Cantor and sets: La diagonale du fou

The Consistency of Quantum Mechanics Implies Its Non-Determinism arxiv: v1 [quant-ph] 19 Oct 2010

Cosmology Lecture 2 Mr. Kiledjian

Science without inductivism

Gottfried Wilhelm Leibniz (1666)

A Strong Relevant Logic Model of Epistemic Processes in Scientific Discovery

Lecture 21: Lasers, Schrödinger s Cat, Atoms, Molecules, Solids, etc. Review and Examples. Lecture 21, p 1

Quantum Entanglement. Chapter Introduction. 8.2 Entangled Two-Particle States

Automata Theory. Definition. Computational Complexity Theory. Computability Theory

Hilbert s problems, Gödel, and the limits of computation

Peano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now

IST 4 Information and Logic

CISC 1002 [CORC 3310, CC 30.10] Paradoxes and the Limits of Knowledge 3 hours; 3 credits

I N T R O D U C T I O N T O

Introduction to the strange world of Quantum Physics

Transcription:

Poincaré, Heisenberg, Gödel. Some limits of scientific knowledge. Fernando Sols Universidad Complutense de Madrid

Henry Poincaré (1854-1912) nonlinear dynamics Werner Heisenberg (1901-1976) uncertainty pricniple Kurt Gödel (1906-1978) incompleteness theorems

Isaac Newton (1643-1727) classical mechanics deterministic universe p( 0), x(0) determines p( t), x( t)

Henry Poincaré (1854-1912) nonlinear dynamics theory of chaos planetary system (2-body problem) is an exception most dynamical systems are chaotic long term evolution very sensitive to initial conditions trajectories in phase space strongly intertwined

Chaotic systems the greater the precision with which we wish to know the future or the farther the future we wish to predict the greater the accuracy with which we need to know the initial conditions Prediction of the future requires knowledge of the present with infinite accuracy p(0) 0 x(0) 0

Heisenberg uncertainty principle position ( x ) and momentum ( p = mv ) cannot be known simultaneously with arbitrary precision. p x 2 The precise prediction of the future is forbidden by quantum mechanics [ local hidden-variable theories rejected by experiment (Bell s theorem ) ]

Poincaré: practical indeterminacy Poincaré + Heisenberg intrinsic indeterminacy

Poincaré: practical indeterminacy Poincaré + Heisenberg intrinsic indeterminacy Future is not determined There is room (although it does not prove) the existence of - Free will (human design) - Providence

Quantum measurement. Wave-packet collapse x y z A x X y Y z Z quantum system macroscopic apparatus measurement (interaction) entangled state system-apparatus X, Y, Z are macroscopically distinct

Quantum measurement. Wave-packet collapse x y z A x X y Y z Z quantum system macroscopic apparatus measurement (interaction) entangled state system-apparatus X, Y, Z are macroscopically distinct in practice only one of the possible states is observed: e.g. y Y, o z Z ( collapse )

Quantum measurement. Wave-packet collapse x y z A x X y Y z Z quantum system macroscopic apparatus measurement (interaction) entangled state system-apparatus X, Y, Z are macroscopically distinct in practice only one of the possible states is observed: e.g. y Y, o z Z ( collapse ) Quantum mechanics only predicts (and very well) the statistics of results in identically prepared experiments. cannot predict the result of an individual experiment The collapse or reduction of the wave function is essential to convert uncertainty about the present unpredictability of the future

Schrödinger s cat paradox A x y x X y Y x y atom X Y cat mechanical detector excited atom entangled state atom-cat cat alive decayed atom dead cat in practice we observe the cat alive or dead

Hyperion satellite of Saturn oblong chaotic rotation mean diameter ~ 300 km rotation period ~ 21 days mass ~ 6 10 18 kg Lyapunov ~ (40 days) -1

Hyperion satellite of Saturn oblong chaotic rotation mean diameter ~ 300 km t ħ ~ 20 yrs W H Zurek (1998) rotation period ~ 21 days mass ~ 6 10 18 kg Lyapunov ~ (40 days) -1

Hyperion satellite of Saturn oblong chaotic rotation mean diameter ~ 300 km rotation period ~ 21 days mass ~ 6 10 18 kg Lyapunov ~ (40 days) -1 t ħ ~ 20 yrs W H Zurek (1998) t > t ħ prediction prohibited by QM information is nowhere

Hyperion satellite of Saturn oblong chaotic rotation mean diameter ~ 300 km rotation period ~ 21 days mass ~ 6 10 18 kg Lyapunov ~ (40 days) -1 t ħ ~ 20 yrs W H Zurek (1998) t > t ħ prediction prohibited by QM information is nowhere ( solar system: t ħ ~ 700 million yrs )

Poincaré: practical indeterminacy Poincaré + Heisenberg intrinsic indeterminacy Future is not determined There is room (although it does not prove) the existence of - Free will (human design) - Providence

What or who determines the future? Initial conditions (determinism) ruled out (except for marginal proposals) Human design External (intelligent) design Chance, randomness non-controversial very controversial

Gödel s incompleteness theorems (1931) A logical system with a finite number of axioms and rules, sufficiently complex to include arithmetics, and consistent (without contradictions): is not complete, i.e. contains theorems which are true but unprovable. We cannot know which ones are those theorems. Given a non-proved and non-refuted conjecture, we cannot know whether: - It s true or false - In any of the two cases: - whether the proof exists but we don t find it, or - whether the proof does not exist

Undecidability There are classes of undecidable statements: Neither T nor no T can be proved, in the general case (although, in each particular case, one of the two has to be true) Example: the halting problem

Alan Turing (1912-1954) Turing machine = universal computer The halting problem (1936): No general algorithm exists to know if a program will lead the computer to a halt. Another instance of undecidable problem: the proof of randomness

What is randomness (chance)? Algorithmic definition: A number secuence is random if it cannot be compressed, i.e. if no program exists which, being shorter than the sequence, does completely determine the sequence. 314159265358979323846264338327950288419716939937510 58209749445923078164062862089986280348253421170679 8214808651328230664709384460955058223172535940812848111745028410270193852110555964462294895493038196 4428810975665933446128475648233786783165271201909145648566923460348610454326648213393607260249141273 7245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094 3305727036575959195309218611738193261179310511854807446237996274956735188575272489122793818301194912 9833673362440656643086021394946395224737190702179860943702770539217176293176752384674818467669405132 0005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235 4201995611212902196086403441815981362977477130996051870721134999999837297804995105973173281609631859 5024459455346908302642522308253344685035261931188171010003137838752886587533208381420617177669147303 5982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989 3809525720106548586327886593615338182796823030195203530185296899577362259941389124972177528347913151 55748572424541506959508295331168617278558890750983 81754637464939319255060400927701671139009848824012 8583616035637076601047101819429555961989467678374494482553797747268471040475346462080466842590694912 9331367702898915210475216205696602405803815019351125338243003558764024749647326391419927260426992279 6782354781636009341721641219924586315030286182974555706749838505494588586926995690927210797509302955 32116534498720275596023648066549911988183479775356 seems random but is not

Gottfried Leibniz (1646-1716) Infinitesimal calculus binary system philosopher, mathematician, jurist, politician (precursor of information theory) 1 1 1 1 1 1 1 4 3 5 7 9 11 13 n ( 1) 2n 1 n 0 Leibniz formula

Gregory Chaitin (1947- ) algorithmic theory of information No general algorithm exists to decide if a sequence is random The random character of a sequence is undecidable (in the Gödel and Turing sense) Randomness cannot be proved

We can t be sure about randomness

Facultad de CC. Físicas UCM, 27 octubre 2011

What or who determines the future? Initial condition (determinism) Human design External (intelligent) design Randomness ruled out non-controversial very controversial (except for marginal proposals)

What or who determines the future? Initial condition (determinism) Human design External (intelligent) design Randomness ruled out non-controversial very controversial unprovable

Randomness cannot be proved The absence of design cannot be proved Randomness (understood as indeterminacy without design) can be a reasonable, useful hypothesis, essential to make progress on some occasions (e.g. statistical physics, quantum physics, evolution theory), but not provable stricto sensu. The concept of randomness cannot be ascribed with certainty to any process. Randomness is a phenomenological concept.

Jacques Monod (1910-1976) (translated from the Spanish version Selection operates with the products of chance indeed, and cannot be fed in any other way; but it acts on a domain of stringent requirements from where randomness is removed [natural selection]. Randomness must be here regarded as essential.

Jacques Monod (1910-1976) (translated from the Spanish version Selection operates with the products of chance indeed, and cannot be fed in any other way; but it acts on a domain of stringent requirements from where randomness is removed [natural selection]. Randomness must be here regarded as essential. circular argument if the existence of chance is presented as a scientific conclusion.

Jacques Monod (1910-1976) After describing some genetic mutations, he writes: [mutations] constitute the only possible source of modifications in the genetic text, itself the sole repository of the organism's hereditary structures, it necessarily follows that chance alone is at the source of every innovation, of all creation in the biosphere. Pure chance, absolutely free but blind, at the very root of the stupendous edifice of evolution: this central concept of modern biology is no longer one among other possible or even conceivable hypotheses. It is today the sole conceivable hypothesis, the only one that squares with observed and tested fact. And nothing warrants the supposition or the hope that on this score our position is likely ever to be revised. [Monod, 1970]. Emphases by Monod.

Karl Popper (1902-1994) falsability criterion A theory is scientific if it is refutable by a conceivable event (experiment), if it is falsable. Stricto sensu, a scientific theory is never verified in a definite way, but it can successfully pass many probes in each of which it could be refuted (falsified). Practical certainty about some theories can be reached.

H. C. Reichel: The hypothesis of randomness is unprovable in principle, and conversely, the teleological thesis is unrefutable in principle. I add: In this sense, the teleological hypothesis is not scientific either, since it does not satisfy Popper s falsability criterion.

Statements about the existence of design may be, occasionally, very reasonable philosophical statements, but are not scientific in a strict sense. Statements about the absence of design are not scientific either, since randomness cannot be proved.

Finality hypothesis is not scientific (stricto sensu) because it s irrefutable in the general case. Chance hypothesis is not scientific (stricto sensu) because it s unverifiable in each particular case.

What or who determines the future? Initial condition (determinism) Human design External (intelligent) design Randomness ruled out non polemic very polemic unprovable Science may suggest the existence of design, but cannot prove it. It cannot prove its absence either. In particular, it cannot prove the absence of Intelligent Design (or its presence). Questions about finality may be of high philosophical interest, but must remain outside the scientific debate.

Provisional limits of science Pushed further by any sound research program. Those facts which, being currently unknown, can eventually be unveiled by scientific progress. Realities within the domain of science and within the reach of science

External limits of science Creation from metaphysical nothing Conscience as subjective experience Ethics (human rights, ) Aesthetics (artistic experience) Concept of God (Popper s net analogy) realities outside the domain of science and therefore outside the reach of science (element of immateriality)

Incompleteness (Gödel) Undeterminacy (Poincaré, Heisenberg) Internal limits of science realities within the domain of science but outside the reach of science future not contained in the present nonobservable causes mathematical truths not reachable by human reason The myth of an all-explaining science is unjustifed, a remnant of 19th century world view. aperture to the idea of trascendence (God, soul, concepts outside science)