Technology and the Evolution of Complexity

Slides:



Advertisements
Similar presentations
ADDER, HALF ADDER & FULL ADDER
Advertisements

Logic Networks …and the card game Boolette
1 Tutorial: ITI1100 Dewan Tanvir Ahmed SITE, UofO.
Genetic Programming.
Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Using building blocks to make bigger circuits
Computer Organization 1 Logic Gates and Adders. Propositions –Venn Diagrams.
The Digital Logic Level
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Using Evolutionary Computation as a Creativity-Support Tool Tim ChabukUniversity of Maryland Jason LohnCarnegie Mellon University Derek LindenX5 Systems.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Designing an ALU Taken from various sources Primary source: Digital Design and Computer Architecture by Harris &Harris.
Gates and Logic Dr John Cowell phones off (please)
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Lecture 18: Hardware for Arithmetic Today’s topic –Intro to Boolean functions (Continued) –Designing an ALU 1.
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Complexity in the Economy and Business IBM Almaden Institute April 12, 2007 W. Brian Arthur External Professor, Santa Fe Institute.
Increasing Returns in the Economy Lagrange Prize talk April 18, 2008, Torino W. Brian Arthur Santa Fe Institute and PARC.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
Principles in the Evolutionary Design of Digital Circuits J. F. Miller, D. Job, and V. K. Vassilev Genetic Programming and Evolvable Machines.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
Controlling Gates Enabling/Disabling Circuits & Controlled Inverters.
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
Haploid-Diploid Evolutionary Algorithms
Overview Part 1 – Design Procedure Part 2 – Combinational Logic
Exclusive OR Gate.
Counters Next, we’ll look at different kinds of counters and discuss how to build them. These are not only examples of sequential analysis and design,
Computer Architecture CST 250
Dr. Clincy Professor of CS
Basics of Digital Logic Design Presentation D
Flip Flop.
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
Reading: Hambley Chapters
Haploid-Diploid Evolutionary Algorithms
Basics Combinational Circuits Sequential Circuits
How does the CPU work? CPU’s program counter (PC) register has address i of the first instruction Control circuits “fetch” the contents of the location.
Logic Gates L Al-zaid Math110.
3.4 Computer systems Boolean logic Lesson 2.
FIGURE 4.1 Block diagram of combinational circuit
CSE 370 – Winter 2002 – Comb. Logic building blocks - 1
Digital Logic.
Sequential Circuits: Latches
Dr. Clincy Professor of CS
Logic Gates.
ECE 667 Synthesis and Verification of Digital Systems
Counters Next, we’ll look at different kinds of counters and discuss how to build them. These are not only examples of sequential analysis and design,
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Chapter 10.3 and 10.4: Combinatorial Circuits
Logic Gates Dr.Halimah Alshehri.
Wendell A. Lim, Connie M. Lee, Chao Tang  Molecular Cell 
Combinational Circuits
Thought of the Day To be what we are, and to become
Logic Circuits I Lecture 3.
Chapter 4 Gates and Circuits.
Digital Logic Department of CNET Chapter-6
Technology Mapping I based on tree covering
Digital Logic Department of CNET Chapter-6
CHAPTER I. of EVOLUTIONARY ROBOTICS Stefano Nolfi and Dario Floreano
Electronics for Physicists
Sequential circuit analysis
LOGIC Circuits.
Design of Digital Circuits Lab 1 Supplement: Drawing Basic Circuits
Adder and Subtractors Discussion D4.1. Adder and Subtractor Circuits Objective: (i) To construct half and full adder circuit and verify its working (ii)
Counters Next, we’ll look at different kinds of counters and discuss how to build them. These are not only examples of sequential analysis and design,
Introduction to Digital IC Design
ECE 352 Digital System Fundamentals
DeMorgan’s Law and Gates
Presentation transcript:

Technology and the Evolution of Complexity Human Complex Systems, Feb 23, 2007 W. Brian Arthur External Professor, Santa Fe Institute

How does the collective of technology evolve over time? And what does this say about the evolution of complexity?

Consider … Novel technologies are constructed from existing technologies … and offer themselves as components—building blocks for the construction of further technologies

Technology Builds Itself from Itself Technology is autopoietic or self-creating: New elements build from existing ones Complication builds from simplicity

W. F. Ogburn’s Claim (1922)

Exponential buildup of technology? Dubious: Many combinatorics possible (Simplest gives 2N – N – 1 possible technologies) Diminishing returns to novelty or to demand possible

An Experiment at FXPAL W. Brian Arthur and Wolfgang Polak Idea - Create an artificial world in which the technologies are logic circuits - Give this world “logic needs” to be potentially fulfilled Allow the system to create technologies to fulfill these by combining previous technologies

Rules of the Experiment 1. Start from one primitive (NAND gate) 2. Make circuits by random combination of existing elements 3. Check to see if any needs (target logic purposes) are fulfilled 4. If so, these novel circuits become new building blocks 5. Better versions (simpler ones) replace previous versions

Tech 20

1-bit adder

2-bit adder

Tech 33: And-3

3-bit adder

4-bit adder

We Find … Quite complicated circuits evolve An 8-bit adder (16 inputs, 9 outputs) is one of 10177,554 possible circuits

We Find … 2. Complicated circuits require intermediate steps … and intermediate needs (Cf. R. Lenski et al. Evol. Origin of Complex Features)

We Find … 3. Buildup is history dependent New technologies build on what is

We Find …   4. Sudden appearance of key circuits (enabling technologies) then quick use of these Full adder appears after 32,000 steps; 2,3,4-bit adders quickly after that

Gales of Destruction When a technology disappears (is replaced) a technology it used may have no further use. That tech then disappears … etc. Q. Are these gales “sand-pile avalanches”? I.e. is the system at self-organized criticality?

Avalanches of destruction follow a power law

Summary: a different view Technology is a self-constructing “chemistry” (-cf. genetic regulatory networks) Technology bootstraps in numbers and complication Innovation: places of generative interaction important Where a chemistry is generated, harbored, nurtured

The Process as Evolutionary Algorithm Our algorithm creates a library of functionalities by constructing new objects from previously existing ones Differs from genetic algorithm or GP in several ways