biologically-inspired computing lecture 6 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing

Similar documents
biologically-inspired computing lecture 5 Informatics luis rocha 2015 biologically Inspired computing INDIANA UNIVERSITY

Chapter 8. Fractals. 8.1 Introduction

biologically-inspired computing lecture 12 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing

Development. biologically-inspired computing. lecture 16. Informatics luis rocha x x x. Syntactic Operations. biologically Inspired computing

biologically-inspired computing lecture 18

biologically-inspired computing lecture 22 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing

Introduction to Informatics

FRACTALS LINDENMAYER SYSTEMS. November 22, 2013 Rolf Pfeifer Rudolf M. Füchslin

CMSC 425: Lecture 11 Procedural Generation: Fractals and L-Systems

biologically-inspired computing lecture 9 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing

Production-rule complexity of recursive structures

Language-Restricted Iterated Function Systems, Koch Constructions, and L-systems

Fractals: How long is a piece of string?

Patterns in Nature 8 Fractals. Stephan Matthiesen

Fractal Geometry Time Escape Algorithms and Fractal Dimension

CPSC 453: L-Systems. Mark Matthews Office Hours: 3:15-4:00PM TR Office: 680J

11. Automata and languages, cellular automata, grammars, L-systems

Cellular Automata. and beyond. The World of Simple Programs. Christian Jacob

Department of Computer Sciences Graphics Fall 2005 (Lecture 8) Fractals

Cellular Automata. ,C ) (t ) ,..., C i +[ K / 2] Cellular Automata. x > N : C x ! N. = C x. x < 1: C x. = C N+ x.

AN INTRODUCTION TO FRACTALS AND COMPLEXITY

Z-ordering. Reduce n-dim to 1-dim points snake-curve z-ordering bit-shuffling Linear quad trees queries Hilbert curve

Introduction to Artificial Life and Cellular Automata. Cellular Automata

AN INTRODUCTION TO FRACTALS AND COMPLEXITY

Mathematical Modelling Lecture 14 Fractals

INTRODUCTION TO FRACTAL GEOMETRY

ILLINOIS LICENSURE TESTING SYSTEM

Repeat tentative ideas from earlier - expand to better understand the term fractal.

COM364 Automata Theory Lecture Note 2 - Nondeterminism

Modeling Neural Processes in Lindenmayer Systems

Fractals. Justin Stevens. Lecture 12. Justin Stevens Fractals (Lecture 12) 1 / 14

Fractals, Dynamical Systems and Chaos. MATH225 - Field 2008

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Modelling with cellular automata

COMP/MATH 300 Topics for Spring 2017 June 5, Review and Regular Languages

cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska

MATHEMATICS (MAT) Mathematics (MAT) 1

Physarum Syllogistic L-Systems

Grammatical Induction with Error Correction for Deterministic Context-free L-systems

Decidability: Church-Turing Thesis

Recursive Function Theory and Computability

Generative urban design with Cellular Automata and Agent Based Modelling

Turing s thesis: (1930) Any computation carried out by mechanical means can be performed by a Turing Machine

Undecidability COMS Ashley Montanaro 4 April Department of Computer Science, University of Bristol Bristol, UK

TSP Water Project Report Snowflakes and Fractals

CS 420/594: Complex Systems & Self-Organization Project 1: Edge of Chaos in 1D Cellular Automata Due: Sept. 20

Fractals in Science. Armin Bunde Shlomo Havlin (Eds.) Springer-Verlag Berlin Heidelberg New York London Paris Tokyo HongKong Barcelona Budapest

Artificial Life. Prof. Dr. Rolf Pfeifer Hanspeter Kunz Marion M. Weber Dale Thomas. Institut für Informatik der Universität Zürich

185.A09 Advanced Mathematical Logic

Chapter 6 Animation of plant development

Fractal structure of the block-complexity function

Co-evolution of Morphology and Control for Roombots

Information, Utility & Bounded Rationality

Developmental Models of Herbaceous Plants for Computer Imagery Purposes

1. Draw a parse tree for the following derivation: S C A C C A b b b b A b b b b B b b b b a A a a b b b b a b a a b b 2. Show on your parse tree u,

Dynamical Systems and Deep Learning: Overview. Abbas Edalat

Toward a Better Understanding of Complexity

Simulation of Cell Group Formation Regulated by Coordination Number, Cell Cycle and Duplication Frequency

The importance of beings fractal

Acknowledgments 2. Part 0: Overview 17

FRACTALS, DIMENSION, AND NONSMOOTH ANALYSIS ERIN PEARSE

Automata Theory (2A) Young Won Lim 5/31/18

Project 1: Edge of Chaos in 1D Cellular Automata

FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY

Homework Gots to be Typeset. We Are Here to help! Dominoes. Inductive Reasoning Lecture 2 (January 19, 2006)

Harvard CS 121 and CSCI E-207 Lecture 9: Regular Languages Wrap-Up, Context-Free Grammars

Foundations of Informatics: a Bridging Course

P systems based on tag operations

Take a line segment of length one unit and divide it into N equal old length. Take a square (dimension 2) of area one square unit and divide

Friendly Logics, Fall 2015, Lecture Notes 1

Great Theoretical Ideas in Computer Science

Peter Wood. Department of Computer Science and Information Systems Birkbeck, University of London Automata and Formal Languages

Dmitri Kartofelev, PhD. Tallinn University of Technology, School of Science, Department of Cybernetics, Laboratory of Solid Mechanics

AC68 FINITE AUTOMATA & FORMULA LANGUAGES DEC 2013

Simulation of cell-like self-replication phenomenon in a two-dimensional hybrid cellular automata model

Dmitri Kartofelev, PhD. Tallinn University of Technology, School of Science, Department of Cybernetics, Laboratory of Solid Mechanics.

Mathematical Biology - Lecture 1 - general formulation

Limits of Computability

DT PhD Seminar in Computer Science

Complex Systems. Shlomo Havlin. Content:

Further discussion of Turing machines

Subsumption of concepts in FL 0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete.

2.1 general items of cellular automata (1)definition of cellular automata. Cellular automata

CSCE 551: Chin-Tser Huang. University of South Carolina

Computational Models Lecture 8 1

Fundamental Questions. Universality. What is a general purpose computer? Computability. Are there problems that no machine can solve?

Chaos, Complexity, and Inference (36-462)

Chaotic Properties of the Elementary Cellular Automaton Rule 40 in Wolfram s Class I

Introduction To Mathematical Modeling

Is there an Elegant Universal Theory of Prediction?

USING THE RANDOM ITERATION ALGORITHM TO CREATE FRACTALS

Harvard CS 121 and CSCI E-121 Lecture 14: Turing Machines and the Church Turing Thesis

Introduction to Informatics

FORMAL LANGUAGES, AUTOMATA AND COMPUTATION

EVALUATING THE EXACT INFINITESIMAL

CS 591 Complex Adaptive Systems Spring 2009 Measures of Complexity. Melanie Moses 1/28/09

Improved TBL algorithm for learning context-free grammar

An Investigation of Fractals and Fractal Dimension. Student: Ian Friesen Advisor: Dr. Andrew J. Dean

SYLLABUS. Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 3 : REGULAR EXPRESSIONS AND LANGUAGES

Turing machines and linear bounded automata

Transcription:

lecture 6 -inspired

Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0 : January 14 th (completed) Introduction to Python (No Assignment) Lab 1 : January 28 th Measuring Information (Assignment 1) Due February 11 th Lab 2 : February 11 th L-Systems (Assignment 2)

Readings until now Class Book Nunes de Castro, Leandro [2006]. Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications. Chapman & Hall. Chapter 8 - Artificial Life Chapter 7, sections 7.1, 7.2 and 7.4 Fractals and L-Systems Appendix B.3.1 Production Grammars Lecture notes Chapter 1: What is Life? Chapter 2: The logical Mechanisms of Life Chapter 3: Formalizing and Modeling the World posted online @ Papers and other materials Life and Information Kanehisa, M. [2000]. Post-genome Informatics. Oxford University Press. Chapter 1. Logical mechanisms of life (H400, Optional for I485) Langton, C. [1989]. Artificial Life In Artificial Life. C. Langton (Ed.). Addison-Wesley. pp. 1-47. Optional Flake s [1998], The Computational Beauty of Life. MIT Press. Chapter 1 Introduction Chapters 5, 6 (7-9) Self-similarity, fractals, L-Systems

Hertzian modeling paradigm Modeling the World The most direct and in a sense the most important problem which our conscious knowledge of nature should enable us to solve is the anticipation of future events, so that we may arrange our present affairs in accordance with such anticipation. (Hertz, 1894) Model Symbols (Images) Initial Conditions Formal Rules (syntax) Logical Consequence of Model Predicted Result???? Observed Result (Pragmatics) Encoding (Semantics) Measure Measure World 1 Physical Laws World 2

exploring similarities across nature Natural design principles self-similar structures Trees, plants, clouds, mountains morphogenesis Mechanism Iteration, recursion, feedback Dynamical Systems and Unpredictability From limited knowledge or inherent in nature? Mechanism Chaos, measurement Collective behavior, emergence, and self-organization Complex behavior from collectives of many simple units or agents cellular automata, ant colonies, development, morphogenesis, brains, immune systems, economic markets Mechanism Parallelism, multiplicity, multi-solutions, redundancy Adaptation Evolution, learning, social evolution Mechanism Reproduction, transmission, variation, selection, Turing s tape Network causality (complexity) Behavior derived from many inseparable sources Environment, embodiment, epigenetics, culture Mechanism Modularity, connectivity, stigmergy

Lewis Richardson's observations (1961) Measured maps with different scales Coasts of Australia, South Africa, and Britain Land frontiers of Germany and Portugal Measured lengths L(d) at different scales d. As the scale is reduced, the length increases rapidly. Well-fit by a straight line with slopes (s) on log/log plots s = -0.25 for the west coast of Britain, one of the roughest in the atlas, s = -0.15 for the land frontier of Germany, s = -0.14 for the land frontier of Portugal, s = -0.02 for the South African coast, one of the smoothest in the atlas. circles and other smooth curves have line of slope 0. Coastlines

regular volumes Integer dimensions Scientific American, July 2008

dimension of fractal curves the Koch curve example: fractional dimensions Koch curve slightly more than line but less than a plane Packing efficiency! n =0 n =1 a=1 unit (meter) n =2 a=1/3 n Measuring scale N=4 n n Hausdorff Dimension Number of units D = log N = 1 log a log 4 log3 = 1.26186... N = 1 a D D = log log N 1 a Unit measure

mathematical monsters re-writing design principle Complex objects are defined by systematically and recursively replacing parts of a simple start object with another object according to a simple rule Cantor Set n =0 n =1 n =2 n Scientific American, July 2008 log N D = 1 log a = 0.6309 Hausdorff Dimension

mathematical monsters re-writing design principle Complex objects are defined by systematically and recursively replacing parts of a simple start object with another object according to a simple rule Sierpinski Gasket Scientific American, July 2008 log N D = 1 log a = 1.585 Hausdorff Dimension

mathematical monsters re-writing design principle Complex objects are defined by systematically and recursively replacing parts of a simple start object with another object according to a simple rule Menger sponge Scientific American, July 2008 log N D = 1 log a = 2.7268 Hausdorff Dimension

dimension of fractal curves Box-counting dimension Number of boxes D log N( ε ) = lim ε 0 1 log ε Length of box side

Peano and Hilbert Curves Filling planes and volumes Hilbert Peano

Self-similarity on multiple scales Due to recursion Fractal dimension Enclosed in a given space, but with infinite number of points or measurement fractal features

reducing volume fractal-like designs in Nature How do these packed volumes and recursive morphologies grow?

An Accurate Model Requires Varying angles Varying stem lengths randomness The Fibonacci Model is similar Initial State: b b -> a a -> ab sneezewort What about our plant? a b a a b a b b a a b b a a b b b Psilophyta/Psilotum

Mathematical formalism proposed by the biologist Aristid Lindenmayer in 1968 as a foundation for an axiomatic theory of biological development. applications in computer graphics Generation of fractals and realistic modeling of plants Grammar for rewriting Symbols Production Grammar Defines complex objects by successively replacing parts of a simple object using a set of recursive, rewriting rules or productions. Beyond one-dimensional production (Chomsky) grammars Parallel recursion Access to computers L-Systems

formal notation of the production system An L-system is an ordered triplet G = <V, w, P> V = alphabet of the symbols in the system V = {F, B} w = nonempty word the axiom: B P = finite set of production rules (productions) B F[-B][+B] F FF L-systems

production rules for artificial plants branching L-Systems Add branching symbols [ ] Main trunk shoots off one side branch simple example Angle 45 Axiom: F Seed Cell Rule: F=F[+F]F Deterministic, context-free L-systems Simplest class of L- systems Simple re-writing D0L F [+F] F

Axiom B Cell Types B,F Rules B F[-B][+B] F FF L-system with 2 cell types Depth Resulting String 0 B 1 F[-B]+B 2 FF[-F[-B]+B]+ F[-B]+B 3 FFFF[-FF[- F[-B]+B]+ FF[-B]+B]+ F[- F[-B]+B]+ F[-B]+B

Discrete nature of L- systems makes it difficult to model continuous phenomena Numerical parameters are associated with L-system symbols Parameters control the effect of productions A ( t ) B ( t x 3) Growth can be modulated by time Varying length of braches, rotation degrees parametric L-systems

parametric L-system example operate on parametric words, which are strings of modules consisting of symbols with associated parameters and their rules From: P. Prusinkiewicz and A. Lindenmayer [1991]. The Algorithmic Beauty of Plants.

Probabilistic production rules A B C ( P = 0.3 ) A F A ( P = 0.5 ) A A B ( P = 0.2 ) stochastic L-systems http://coco.ccu.uniovi.es/malva/sketchbook/

2L-Systems Context-sensitive L-systems Production rules depend on neighbor symbols in input string simulates interaction between different parts necessary to model information exchange between neighboring components 2L-Systems P: a l < a > a r X P1: A<F>A A P2: A<F>F F 1L-Systems P: a l < a X or P: a > a r X Generalized to IL-Systems (k,l)-system left (right) context is a word of length k(l)

parametric 2L-system example convenient tool for expressing developmental models with diffusion of substances. pattern of cells in Anabaena catenula and other blue-green bacteria From: P. Prusinkiewicz and A. Lindenmayer [1991]. The Algorithmic Beauty of Plants.

readings Next lectures Class Book Nunes de Castro, Leandro [2006]. Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications. Chapman & Hall. Chapter 7, sections 7.1, 7.2 and 7.4 Fractals and L-Systems Appendix B.3.1 Production Grammars Lecture notes Chapter 1: What is Life? Chapter 2: The logical Mechanisms of Life Chapter 3: Formalizing and Modeling the World posted online @ Papers and other materials Logical mechanisms of life (H400, Optional for I485) Langton, C. [1989]. Artificial Life In Artificial Life. C. Langton (Ed.). Addison-Wesley. pp. 1-47. Optional Flake s [1998], The Computational Beauty of Life. MIT Press. Chapter 1 Introduction Chapters 5, 6 (7-9) Self-similarity, fractals, L-Systems Prusinkiewicz and Lindenmeyer [1996] The algorithmic beauty of plants. Chapter 1