Conclusions forthcoming

Slides:



Advertisements
Similar presentations
Modelling with expert systems. Expert systems Modelling with expert systems Coaching modelling with expert systems Advantages and limitations of modelling.
Advertisements

Microcomputer Circuits Prof Jess UEAB 2007 Designing a Microprocessor Chapter 1.
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
PSU CS 370 – Artificial Intelligence Dr. Mohamed Tounsi Artificial Intelligence 1. Introduction Dr. M. Tounsi.
SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 1.
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
Computer Organization and Assembly Language: Chapter 7 The Karnaugh Maps September 30, 2013 By Engineer. Bilal Ahmad.
New Mexico Computer Science for All Computational Science Investigations (from the Supercomputing Challenge Kickoff 2012) Irene Lee December 9, 2012.
In a not gate, if the input is on(1) the output is off (0) and vice versa.
Cellular Automata Avi Swartz 2015 UNC Awards Ceremony.
Introduction At the heart of the growth of a multi-cellular organism is the process of cellular division… … aka (in computing) self-replication.
Binary Logic and Gates COE 202 Digital Logic Design Dr. Aiman El-Maleh
Problem (Question) (Difficulty). Decisions Problem (Question) (Difficulty) Decisions Research.
Discovery of Cellular Automata Rules Using Cases Ken-ichi Maeda Chiaki Sakama Wakayama University Discovery Science 2003, Oct.17.
LOGIC GATES Logic generally has only 2 states, ON or OFF, represented by 1 or 0. Logic gates react to inputs in certain ways. Symbol for AND gate INPUT.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Chapter I: Introduction to Computer Science. Computer: is a machine that accepts input data, processes the data and creates output data. This is a specific-purpose.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
AUTOMATA THEORY Reference Introduction to Automata Theory Languages and Computation Hopcraft, Ullman and Motwani.
Course material – G. Tempesti Course material will generally be available the day before the lecture Includes.
Playing God: The Engineering of Functional Designs in the Game of Life Liban Mohamed Computer Systems Research Lab
Logic Gates It’s Only Logical. Logic Gates Are the switches that computers and similar devices use. They hold their state until something changes. Are.
Elizabeth Furtado, Vasco Furtado, Kênia Sousa, Jean Vanderdonckt, Quentin Limbourg KnowiXML: A Knowledge-Based System Generating Multiple Abstract User.
Basic Gates 1.1 Basic Digital Logic: AND, OR and NOT gates ©Paul Godin Created August 2007 Last Update Sept 2013.
1 Formal Languages & Automata. 2 A formal language: Is an abstraction of the general characteristics of programming languages. Consists of a set of symbols.
AND Gate Inputs Output Input A (Switch) Input B (Switch) Output Y (Lamp) 0 (Open) 0 (OFF) A B Lamp.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
©Brooks/Cole, 2003 Chapter 1 Introduction. ©Brooks/Cole, 2003 Figure 1-1 Data processor model This model represents a specific-purpose computer not a.
Computer Systems Architecture Edited by Original lecture by Ian Sunley Areas: Computer users Basic topics What is a computer?
Chapter I: Introduction to Computer Science. Computer: is a machine that accepts input data, processes the data and creates output data. This is a specific-purpose.
Theory of nonlinear dynamic systems Practice 12
Cellular automata.
Introduction Abstract
Abstraction and Refinement for Large Scale Model Checking
CIS Automata and Formal Languages – Pei Wang
Logic gates Boolean Algebra
Mazen Alkoa’ & Ahmad Nabulsi Submitted to Dr. Sufyan Samara
CSCI-100 Introduction to Computing
Illustrations of Simple Cellular Automata
Welcome to my presentation
Computer Architecture CST 250
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.
3.4 Computer systems Boolean logic Lesson 2.
Unit 20 Software Part 2.
Cellular Automata.
Multi-Step Equation Game! Play!.
Unit 20 Software Part 2.
Excursions into Logic Based Computation using Conway’s Game of Life
DIGITAL ELECTRONICS B.SC FY
Algorithms.
in Intelligent Tutoring Systems with Fuzzy Logic Techniques
The Engineering of Functional Designs in the Game of Life
Binary Logic.
Basic Digital Logic: AND, OR and NOT gates Technician Series
What if you could build a trinary computer?
The Engineering of Functional Designs in the Game of Life Computer Systems Lab June 10, 2008 Liban Mohamed Abstract First, this project endeavours.
Logic and Logic Gates Ian Gover Education Technology Adviser
75 previous answer What is of 37.5? ? go to.
EXPLICIT RULES: INPUT-OUTPUT FORMULAS
Introduction to Logic diagrams and truth tables
Further binary, Logic diagrams and truth tables
Carryout bit? Carryout bit is ‘1’ also on four cases. When a, b and carryin are 110, 101, 011, 111. Does it mean that we need a similar circuit as sum?
COMPUTER HISTORY, PRESENT & FUTURE. What is a Computer? A computer is a machine that can be instructed to carry out sequences of arithmetic or logical.
CO Games Development 2 Week 21 Turing Machines & Computability
Introduction to Logic diagrams and truth tables
Binary Logic and Gates COE 202 Digital Logic Design Dr. Aiman El-Maleh
75 previous answer What is of 60? ? go to.
Thinking as Computation
SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.
Presentation transcript:

Conclusions forthcoming Playing God: The Engineering of Functional Designs in the Game of Life Liban Mohamed Introduction Conway's Game of Life is a set of rules in a two dimensional cellular automata grid. This ruleset was specifically chosen by John Conway for the ability to create stable patterns as well as the difficulty of creating patterns which grow without bound. This difficulty was rather quickly overcome by Bill Gosper's glider gun, which opened up the ability to create binary computational devices such as logic gates. As soon as the possibility of binary computational devices in the Game of Life was discovered, it was realized that patterns could be designed in the Game of Life which could symbolically carry out computations. This project endeavors to facilitate in the design and creation of functional patterns in the Game of Life. Abstract First, this project endeavours to create a flexible and powerful Game of Life interface. After that is achieved, this project goes on the create search programs for patterns in the Game of Life. Finally, this project intends to use the functionality enabled by the previous two steps to design a pattern which can be used for computation in the Game of Life. That is, the purpose of this project is to create one or more patterns in the game of life which take an input in the game of life and consistently produce an output which can be interpreted to get the right answer. Procedures The procedure followed in this project was to first create the programs necessary for the design and creation of functional programs in the Game of Life, and then to use these programs to actually create such a pattern. Conclusions Conclusions forthcoming