Emulation, Reduction, and Emergence in Dynamical Systems Marco Giunti Università di Cagliari, Italy

Slides:



Advertisements
Similar presentations
Comparative Succinctness of KR Formalisms Paolo Liberatore.
Advertisements

Possible World Semantics for Modal Logic
Argumentation Based on the material due to P. M. Dung, R.A. Kowalski et al.
CSCI 4325 / 6339 Theory of Computation Zhixiang Chen Department of Computer Science University of Texas-Pan American.
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
NP-complete and NP-hard problems Transitivity of polynomial-time many-one reductions Concept of Completeness and hardness for a complexity class Definition.
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
Discrete Structures & Algorithms Counting Counting I: One-To-One Correspondence and Choice Trees.
Computability and Complexity 4-1 Existence of Undecidable Problems Computability and Complexity Andrei Bulatov.
Discrete Structures Chapter 5 Relations and Functions Nurul Amelina Nasharuddin Multimedia Department.
CELLULAR AUTOMATON Presented by Rajini Singh.
© Love Ekenberg The Algorithm Concept, Big O Notation, and Program Verification Love Ekenberg.
NP-complete and NP-hard problems
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 23 Instructor: Paul Beame.
CS 454 Theory of Computation Sonoma State University, Fall 2011 Instructor: B. (Ravi) Ravikumar Office: 116 I Darwin Hall Original slides by Vahid and.
Normal forms for Context-Free Grammars
Computability and Complexity 10-1 Computability and Complexity Andrei Bulatov Gödel’s Incompleteness Theorem.
Discrete Mathematics Lecture#11.
Introduction to Proofs Goals 1.Introduce notion of proof & basic proof methods. 2.Distinguish between correct & incorrect arguments 3.Understand & construct.
The Second Law of Thermodynamics Chapter Introduction The first law of thermodynamics is simple, general, but does not constitute a complete theory.
Mathematics.
Applied Discrete Mathematics Week 10: Equivalence Relations
Definitions of Reality (ref . Wiki Discussions)
The physical reductive explainability of phenomenal consciousness and the logical impossibility of zombies Marco Giunti University of Cagliari (Italy)
Mathematics. Session Set, Relation & Function Session - 3.
The Research Paper: Developing an Outline
The Research Paper: Developing an Outline
Discrete dynamical systems and intrinsic computability Marco Giunti University of Cagliari, Italy
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
© Kenneth C. Louden, Chapter 11 - Functional Programming, Part III: Theory Programming Languages: Principles and Practice, 2nd Ed. Kenneth C. Louden.
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
1 Cellular Automata and Applications Ajith Abraham Telephone Number: (918) WWW:
Cellular Automata & DNA Computing 우정철. Definition Of Cellular Automata Von Von Neuman’s Neuman’s Definition Wolfram’s Wolfram’s Definition Lyman.
Week 14 - Wednesday.  What did we talk about last time?  Regular expressions  Introduction to finite state automata.
The Second Law of Thermodynamics
Discrete Mathematical Structures 4 th Edition Kolman, Busby, Ross © 2000 by Prentice-Hall, Inc. ISBN
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesBoolean Algebra.
Levels of reality, realization and reduction: A dynamical outlook Marco Giunti University of Cagliari, Italy
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
A New Kind of Science by Stephen Wolfram Principle of Computational Equivalence - Ting Yan,
Discrete Systems with Undecidable Dynamics Marco Giunti Marco Giunti Università di Cagliari 1Bochum,
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
(CSC 102) Lecture 13 Discrete Structures. Previous Lectures Summary  Direct Proof  Indirect Proof  Proof by Contradiction  Proof by Contra positive.
 2005 SDU Lecture13 Reducibility — A methodology for proving un- decidability.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.
We will now study some special kinds of non-standard quantifiers. Definition 4. Let  (x),  (x) be two fixed formulae of a language L n such that x is.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
1 Section 13.1 Turing Machines A Turing machine (TM) is a simple computer that has an infinite amount of storage in the form of cells on an infinite tape.
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
1 Turing Machines and Equivalent Models Section 13.1 Turing Machines.
Overview of the theory of computation Episode 3 0 Turing machines The traditional concepts of computability, decidability and recursive enumerability.
Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 4 Decidability Some slides are in courtesy.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesBoolean Algebra.
Functions CSRU1400 Spring 2008Ellen Zhang 1 CISC1400, Fall 2010 Ellen Zhang.
1 Finite Model Theory Lecture 5 Turing Machines and Finite Models.
On computable numbers, with an application to the ENTSCHEIDUNGSPROBLEM COT 6421 Paresh Gupta by Alan Mathison Turing.
Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)
Abstractions Eric Feron. Outline Principles of abstraction Motivating example Abstracting variables Abstracting functions Abstracting operators Recommended.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
D. N. Seppala-Holtzman St. Joseph’s College faculty.sjcny.edu/~holtzman.
? Anti-realism, reductionism, reference
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
Unit-III Algebraic Structures
Chapter 3 The Real Numbers.
Homework: Friday Read Section 4.1. In particular, you must understand the proofs of Theorems 4.1, 4.2, 4.3, and 4.4, so you can do this homework. Exercises.
On Kripke’s Alleged Proof of Church-Turing Thesis
Lecture 19 Models of Computation (S&G, ch. 10)
Chapter 3 The Real Numbers.
CSE S. Tanimoto Turing Completeness
Presentation transcript:

Emulation, Reduction, and Emergence in Dynamical Systems Marco Giunti Università di Cagliari, Italy

Outline The received view about emergence and reduction is that they are incompatible categories. (Beckermann 1992; Kim 1992) Contrary to the received view, I argue that emergence and reduction can hold together. In dynamical systems, emulation is sufficient for reduction; this representational view of reduction, contrary to the standard deductivist one, is compatible with the existence of structural properties of the reduced system that are not also properties of the reducing one. Thus, under this view, reduction and emergence are not incompatible.

A classic definition of emergence Intuitively, a property of a high level system is said to be emergent if it is not one of the properties of more basic parts, which, together, make up the system. More precisely: A property P of a high level system S 2 is emergent with respect to a lower level system S 1 just in case (a) S 2 is made up of S 1 (intuitively, S 1 is the system of the constitutive parts of S 2 taken in isolation, or in relations different from those typical of S 2 ; see Broad 1925) and (b) P is not one of the properties of S 1.

Reduction – received view It is obvious that, if S 2 is reduced to S 1, then all properties of S 2 are properties of S 1 ; thus, by condition (b) of the definition of emergence, it follows that emergence and reduction are incompatible. My view: by no means is the above principle obvious; in fact, it is false. It thus follows that emergence and reduction may hold together.

The argumentative strategy To support this thesis, I will focus attention on dynamical systems, and on the emulation relationship between them; in virtue of a general representation theorem, I will argue that, for any two dynamical systems, the emulation relationship is sufficient for both reduction and constitution (i.e., the being made up of relationship); therefore, to show that both reduction and emergence can hold together, it will suffice to exhibit two dynamical systems DS 1 and DS 2, as well as a property P, such that DS 1 emulates DS 2, DS 2 has P, but DS 1 does not have P.

Example of a continuous Dyn. Syst. The Galilean model of free fall Explicit specification Let F = (M, (g t ) t  T ) such that  M = S  V and S = V = T = real numbers  g t (s, v) = (s + vt + at 2 /2, v + at) Implicit specification Let F = (M, (g t ) t  T ) such that  M = S  V and S = V = T = real numbers  ds(t)/dt = v(t), dv(t)/dt = a

Rule Rule number = Time Time Twelve cells arranged in a circle. The value of each cell is either 0 or 1. Thus, the CA has 2 12 = 4096 possible states. Example of a discrete Dyn. Syst. A finite Cellular Automaton

A Dynamical System (DS) is a mathematical model that expresses the idea of a deterministic system (discrete/continuous, revers./irrevers.) A Dynamical System (DS) is a set theoretical structure (M, (g t ) t  T ) such that: 1.the set M is not empty; M is called the state-space of the system; 2.the set T, is either Z, Z + (integers) or R, R + (reals); T is called the time set; 3.(g t ) t  T is a family of functions from M to M; each function g t is called a state transition or a t-advance of the system; 4.for any t and w  T, for any x  M, a.g 0 (x) = x; b.g t+w (x) = g w (g t (x)).

Intuitive meaning of the definition of dynamical system gt+wgt+w x gwgw x g0g0 x gtgt t0t0 t0+tt0+t gt(x)gt(x) t gtgt

Isomorphism between two DSs Definition u is an isomorphism of DS 2 = (N, (h v ) v  V ) in DS 1 = (M, (g t ) t  T ) iff T = V, u: N  M is a bijection and, for any v  V, for any c  N, u(h v (c)) = g v (u(c)). DS 2 is isomorphic to DS 1 iff there is u which is an isomorphism of DS 2 in DS 1 gvgv u hvhv u c MN

Emulation between two DSs Intuition and examples Intuitively, a DS emulates a second DS when the first one exactly reproduces the whole dynamics of the second one. Examples (i) a universal Turing machine emulates all TMs; (ii) for any TM there is a cellular automaton CA that emulates TM, and vice versa; (iii) emulation holds between two binary CAs with neighborhood of radius 1 (Wolfram’s rule 22 emulates rule 146).

Emulation between two DSs Definition u is an emulation of DS 2 = (N, (h v ) v  V ) in DS 1 = (M, (g t ) t  T ) iff u: N  M is an injection and, for any v  V, for any c  N, there is t  T such that u(h v (c)) = g t (u(c)) DS 1 emulates DS 2 iff there is u which is an emulation of DS 2 in DS 1 gtgt u hvhv u c MN u(N)u(N)

Virtual System Theorem [VST] If u is an emulation of DS 2 = (N, (h v ) v  V ) in DS 1 = (M, (g t ) t  T ), there is a third system DS 3 = (N, (h v ) v  V ) such that (i) u is an isomorphism of DS 2 in DS 3 ; (ii) all states of DS 3 are states of DS 1 [because N = u(N)] ; (iii) any state transition h v of DS 3 is constructed out of state transitions of DS 1. gtgt u hvhv u c M N u(N)u(N) a hvhv u -1 DS 3 is called the virtual u-system DS 2 in DS 1 gtgt

Emulation → constitution and reduction Because of [VST], if a dynamical system DS 1 emulates a second system DS 2, it makes perfect sense to claim that DS 2 is made up of DS 1, as well as that DS 2 is reduced to DS 1. In other words, I maintain that, in virtue of [VST], emulation is sufficient for both constitution and reduction.

Emergence and reduction hold together: example a pair of cascades DS 1 = (M, (g t ) t  Z + ) and DS 2 = (N, (h v ) v  Z + ) such that (i) DS 2 is reduced to DS 1 and (ii) the property P of strong irreversibility is an emergent property of DS 2 with respect to DS 1 h1h1 u a MN u c g1g1 b x y z u h1h1 h1h1 g1g1 g1g1 DS 1 emulates DS 2, DS 1 is logically reversible (thus, not strongly irreversible), and DS 2 is strongly irreversible

That’s all Thank you

References Beckermann, Ansgar (1992), “Supervenience, Emergence and Reduction”, in Ansgar Beckermann, Tommaso Toffoli, and Jaegwon Kim (eds.), Emergence or Reduction? Essays on the Prospects of Nonreductive Physicalism. Berlin: Walter de Gruyter, Broad, Charlie Dunbar (1925), The Mind and its Place in Nature. London: Routledge and Kegan Paul. Kim, Jaegwon (1992), “Downward Causation in Emergentism and Non-reductive Physicalism”, in Ansgar Beckermann, Tommaso Toffoli, and Jaegwon Kim (eds.), Emergence or Reduction? Essays on the Prospects of Nonreductive Physicalism. Berlin: Walter de Gruyter,