We must therefore not be discouraged by the difficulty of interpreting life by the ordinary laws of physics... We must also be prepared to find a new.

Slides:



Advertisements
Similar presentations
Henry Haselgrove School of Physical Sciences University of Queensland
Advertisements

Quantum One: Lecture 1a Entitled So what is quantum mechanics, anyway?
Postulates of Quantum Mechanics. The Fundamental Rules of Our Game Any measurement we can make with an experiment corresponds to a mathematical “operator”
The reductionist blind spot: Russ Abbott Department of Computer Science California State University, Los Angeles higher-level entities and the laws they.
The reductionist blind spot Russ Abbott Department of Computer Science California State University, Los Angeles Why square pegs don’t fit into round holes.
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
1 Introduction to Computability Theory Lecture13: Mapping Reductions Prof. Amos Israeli.
CPSC 411, Fall 2008: Set 12 1 CPSC 411 Design and Analysis of Algorithms Set 12: Undecidability Prof. Jennifer Welch Fall 2008.
1 Recap Heisenberg uncertainty relations  The product of the uncertainty in momentum (energy) and in position (time) is at least as large as Planck’s.
The reductionist blind spot: Russ Abbott Department of Computer Science California State University, Los Angeles three examples.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
The reductionist blind spot: Russ Abbott Department of Computer Science California State University, Los Angeles three examples.
Humans, Computers, and Computational Complexity J. Winters Brock Nathan Kaplan Jason Thompson.
The reductionist blind spot: Russ Abbott Department of Computer Science California State University, Los Angeles three examples.
Lecture of Norm Margolus. Physical Worlds Some regular spatial systems: –1. Programmable gate arrays at the atomic scale –2. Fundamental finite-state.
Three conceptions of emergence: Material (ontological) Objective unpredictability Conceptual.
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 5 Reducibility Contents Undecidable Problems from Language Theory.
Computability and Complexity 10-1 Computability and Complexity Andrei Bulatov Gödel’s Incompleteness Theorem.
The reductionist blind spot: Russ Abbott Department of Computer Science California State University, Los Angeles three examples.
The reductionist blind spot: Russ Abbott Department of Computer Science California State University, Los Angeles higher-level entities and the laws they.
MSEG 803 Equilibria in Material Systems 6: Phase space and microstates Prof. Juejun (JJ) Hu
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
David Evans Turing Machines, Busy Beavers, and Big Questions about Computing.
Governor’s School for the Sciences Mathematics Day 13.
1 CO Games Development 2 Week 21 Turing Machines & Computability Gareth Bellaby.
Institute for Experimental Physics University of Vienna Institute for Quantum Optics and Quantum Information Austrian Academy of Sciences Undecidability.
1 Cellular Automata and Applications Ajith Abraham Telephone Number: (918) WWW:
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
Cellular Automata & DNA Computing 우정철. Definition Of Cellular Automata Von Von Neuman’s Neuman’s Definition Wolfram’s Wolfram’s Definition Lyman.
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
Conceptual Modelling and Hypothesis Formation Research Methods CPE 401 / 6002 / 6003 Professor Will Zimmerman.
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
The reductionist blind spot: Russ Abbott Department of Computer Science California State University, Los Angeles higher-level entities and the laws they.
1.Physics - Part of science that describes (not "explains") the behavior of matter and its interactions at the most fundamental level. Physics is based.
Germano Maioli Penello Chapter 7 Magnetism in the localised electron model Presentation based on the book Magnetism: Fundamentals, Damien Gignoux & Michel.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
1 MODELING MATTER AT NANOSCALES 4. Introduction to quantum treatments Outline of the principles and the method of quantum mechanics.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
1 Turing’s Thesis. 2 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine (1930)
Computation Motivating questions: What does “computation” mean? What are the similarities and differences between computation in computers and in natural.
Review Session BS123A/MB223 UC-Irvine Ray Luo, MBB, BS.
Chapter 4 Computation Chapter 4: Computation.
MA354 Math Modeling Introduction. Outline A. Three Course Objectives 1. Model literacy: understanding a typical model description 2. Model Analysis 3.
Overview of the theory of computation Episode 3 0 Turing machines The traditional concepts of computability, decidability and recursive enumerability.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
Week 7 - Wednesday.  What did we talk about last time?  Proving the subset relationship  Proving set equality  Set counterexamples  Laws of set algebra.
Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 5 Reducibility Some slides are in courtesy.
David Evans CS200: Computer Science University of Virginia Computer Science Class 26: Halting Problem It is plain at any.
MA/CSSE 474 Theory of Computation Universal Turing Machine Church-Turing Thesis Delayed due dates for HWs See updated schedule page. No class meeting.
IGEM 2009 Tutorial Modelling. What? Model A model in science is a symplified physical, mathematical, or logical representation of a system of entities,
Sub-fields of computer science. Sub-fields of computer science.
Lattice Boltzmann Modeling
CIS Automata and Formal Languages – Pei Wang
UNIT 1 Quantum Mechanics.
COMPUTER ARCHITECTURE AND THE CYNAIDE COATED APPLE.
CHAPTER 5 The Schrodinger Eqn.
Chemistry 141 Friday, November 3, 2017 Lecture 25 H Atom Orbitals
Schrödinger Theory of the Electronic Structure of Matter from a ‘Newtonian’ Perspective Viraht Sahni.
Quantum Hall Fluids By Andrew York 12/5/2008.
Quantum mechanics from classical statistics
CHAPTER 5 The Schrodinger Eqn.
فصل سوم The Church-Turing Thesis
Decidable Languages Costas Busch - LSU.
Week 5: INTERNAL CRISIS Armahedi Mahzar ICAS Jacarta 2010
Computability and Complexity
Quantum computation with classical bits
Recall last lecture and Nondeterministic TMs
Class 24: Computability Halting Problems Hockey Team Logo
Properties of Relational Logic
CO Games Development 2 Week 21 Turing Machines & Computability
Presentation transcript:

We must therefore not be discouraged by the difficulty of interpreting life by the ordinary laws of physics... We must also be prepared to find a new type of physical law prevailing in it. Schrodinger - Nobel Laureate 1933 Schrodinger Can this law be derived (in principle) from fundamental physics alone? `Theory of Everything’ on Fundamental Particles Candidate Law Yes/No Ultra-Powerful Computer Nearby 747s

Fundamental Particles Flock of Birds Flocks of Birds are made out of Fundamental Particles

Single Bird Dynamics Dynamics Particle Physics Atomic Physics ChemistryChemistry BiologyBiology Laws of Flocking The Laws of Particle Physics imply the Laws of Flocking

“At each stage, entirely new laws are necessary, new laws, concepts and generalisations are necessary, requiring inspiration and creativity.” "The ability to reduce everything to simple fundamental laws does not imply the ability to start from those laws and reconstruct the universe.” – ”More is Different” Science 1972 AndersenAndersen ” “Everything is either Physics or Stamp Collecting” Rutherfor d

Quantum Mechanics Continuum Mechanics Additional Law Density Stress Viscosit y Friction Defined only on the Infinite limit. Defined only on the Infinite limit. The axioms of any mathematical system is `known’, yet there exists many propositions of such systems that are formally undecidable. Gödel's Incompleteness Theorem:

Quantum Mechanics Continuum Mechanics Additional Law without Reverse Causality Additional Law without Reverse Causality InspirationInspiration Experiment s

b 1,3 = 1 b 2,3 = 0

b 1,3 = 1 Introduce Hamiltonian b 2,3 = 0 c 1,1 = 3 EXAMPL E: H = = 4

Introduce Hamiltonian b 1,3 = 1 b 2,3 = 0 c 11 = M 11,21 = 4 EXAMPL E: H = – 4 = 0 Interaction Single Body

The Ising Lattice is crude model of a range of biological systems. k = 3 Protein Folding FlockingFlocking Magnetis m Neural Networks

FlockingFlocking The Direct Approach: Simulate everything from first principles. Computationally Infeasible for even systems of modest size Even if we could simulate something, we may still not understand it without appealing to macroscopic concepts. Magnetis m

FlockingFlocking Magnetizatio n Group Velocity Proportion of Spins in `1’ State Reductionism contends that these macroscopic observables can always be logically deduced from a fundamental description of the system. Any Macroscopi c Property Enter Macroscopic Principles: The existence of a biological law indicates that the system can be understood in terms of macroscopic observables, and the macroscopic principles that govern them Magnetis m

FlockingFlocking What we show: Any averaging macroscopic property of the lowest energy state of such Ising Lattices are formally undecidable. Proportion of Spins in `1’ State Magnetizatio n Group Velocity Any laws that govern such properties cannot be derived from fundamental principles. X Proportion of Spins in `1’ State Magnetis m

There exists no way to determined whether a given Turing machine (Computer) will Halt, or run forever. The Halting Problem: Does the program square its inputs? Does the program halt? Does the program destroy your computer? Does the program square its inputs? Does the program halt? Does the program destroy your computer? EXAMPLE: TURING MACHINE

Rice’s Theorem Any Black Box Property of a Turing Machine is undecidable. x T(x) P = 0 P = 1 Property P A function P that maps the configuration space of the system to a real number.

Rice’s Theorem Any Black Box Property of a Turing Machine is undecidable. x T(x) P = 0 P = 1 A function P that maps the configuration space of the system to a real number. Property P Rice’s Theorem (Physical) P is dependent on T(x) for some universal encoding, then P is undecidable.

Input Output There exists many `Universal System’, systems capable of simulating Turing Machines. EXAMPLE: CELLULAR AUTOMOTAS Rule 110 Game of Life EXAMPLE: TURING MACHINE

EXAMPLE: CELLULAR AUTOMOTAS Rule 110 Game of Life f EXAMPLE: TURING MACHINE

`0’ and `1’ Encoded by Gliders EXAMPLE: CELLULAR AUTOMOTAS Rule 110 Game of Life EXAMPLE: TURING MACHINE Prosperity (Average Number of Alive Cells) is Undecidible. Rice’s Theorem (Physical)

EXAMPLE: CELLULAR AUTOMOTAS Rule 110 Game of Life 1.Show the Periodic Ising Lattice can encode an arbitrary CA, and hence is universal. Prosperity (Average Number of Alive Cells) is Undecidible.

EXAMPLE: CELLULAR AUTOMOTAS Rule 110 Game of Life 1.Show the Ising Lattice can encode an arbitrary CA, and hence is universal. 2. Show that knowledge of a given Macroscopic Property of the ground state implies knowledge of the Prosperity of the underlying CA. Prosperity (Average Number of Alive Cells) is Undecidible.

EXAMPLE: CELLULAR AUTOMOTAS Rule 110 Game of Life 1.Show the Ising Lattice can encode an arbitrary CA, and hence is universal. 2. Show that knowledge of a given Macroscopic Property of the ground state implies knowledge of the Prosperity of the underlying CA. Prosperity (Average Number of Alive Cells) is Undecidible. Knowledge of the Property Solves the Halting Problem.

Any Boolean Function f, can be simulated by a finite Ising Block.

WireWire NOTNOT FANOUTFANOUT NANDNAND XORXOR Observe that there exists a Designer Ising Block for each basic logical operation: ProofProof

f Any Cellular Automata.... Automata.... With Update Rule f... FANOUTFANOUT SWA P HfHfHfHf HfHfHfHf Can be simulated be a periodic tessellation of Designer Ising Blocks.. 1.Show the Ising Lattice can encode an arbitrary CA, and hence is universal. 2. Show that knowledge of a given Macroscopic Property of the ground state implies knowledge of the Prosperity of the underlying CA.

Prosperity (Average Number of Alive Cells) is Undecideble. Magnifier Block L STRATEG Y: Engineer a CA Encoding so that a given physical property is highly dependent on the Prosperity of the underlying encoding. or Input 0 Input 1 Degeneracy Magnifier or Input 0 Input 1 Correlations Magnifier Knowledge of these properties lead to knowledge of Prosperity or Input 0 Input 1 Magnetization Magnifier:

Any averaging Macroscopic Properties of the Periodic Ising Lattice at Ground State are in general, undecidable. k = 3

We must therefore not be discouraged by the difficulty of interpreting life by the ordinary laws of physics... We must also be prepared to find a new type of physical law prevailing in it. Schrodinger - Nobel Laureate 1933 Schrodinger The observable quantities of Biological Systems generally makes some continuity assumption at some stage. Bird Density Bird Species Wind Speed Magnetic Fields

We must therefore not be discouraged by the difficulty of interpreting life by the ordinary laws of physics... We must also be prepared to find a new type of physical law prevailing in it. Schrodinger - Nobel Laureate 1933 Schrodinger Fundamental Laws Biological Laws InspirationInspiration Biological Laws potentially contain additional knowledge over fundamental physics... Even if a `Law of Everything’ was found and a super-computer readily available, it is unlikely that biological laws can be systematically derived. The observable quantities of Biological Systems generally makes some continuity assumption at some stage. Bird Density Bird Species Wind Speed Magnetic Fields