Investigating Cellular Automata

Similar documents
MATH 247/Winter Notes on the adjoint and on normal operators.

1 Onto functions and bijections Applications to Counting

CHAPTER 4 RADICAL EXPRESSIONS

Some Notes on the Probability Space of Statistical Surveys

We have already referred to a certain reaction, which takes place at high temperature after rich combustion.

Functions of Random Variables

CHAPTER VI Statistical Analysis of Experimental Data

Chapter 9 Jordan Block Matrices

8.1 Hashing Algorithms

NP!= P. By Liu Ran. Table of Contents. The P versus NP problem is a major unsolved problem in computer

A Study on Generalized Generalized Quasi hyperbolic Kac Moody algebra QHGGH of rank 10

Econometric Methods. Review of Estimation

Lebesgue Measure of Generalized Cantor Set

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions

Descriptive Statistics

Summary of the lecture in Biostatistics

Lecture 3 Probability review (cont d)

To use adaptive cluster sampling we must first make some definitions of the sampling universe:

4 Inner Product Spaces

NP!= P. By Liu Ran. Table of Contents. The P vs. NP problem is a major unsolved problem in computer

Introduction to local (nonparametric) density estimation. methods

MA 524 Homework 6 Solutions

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

Entropy ISSN by MDPI

AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

Exercises for Square-Congruence Modulo n ver 11

For combinatorial problems we might need to generate all permutations, combinations, or subsets of a set.

Chapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements

Maximum Likelihood Estimation

18.413: Error Correcting Codes Lab March 2, Lecture 8

3D Geometry for Computer Graphics. Lesson 2: PCA & SVD

The internal structure of natural numbers, one method for the definition of large prime numbers, and a factorization test

C-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory

Multivariate Transformation of Variables and Maximum Likelihood Estimation

DIFFERENTIAL GEOMETRIC APPROACH TO HAMILTONIAN MECHANICS

QR Factorization and Singular Value Decomposition COS 323

n -dimensional vectors follow naturally from the one

TESTS BASED ON MAXIMUM LIKELIHOOD

Solving Constrained Flow-Shop Scheduling. Problems with Three Machines

CHAPTER 3 POSTERIOR DISTRIBUTIONS

6.867 Machine Learning

Maps on Triangular Matrix Algebras

Computational Geometry

Chapter Statistics Background of Regression Analysis

Lecture 07: Poles and Zeros

Ideal multigrades with trigonometric coefficients

Chapter 11 Systematic Sampling

On L- Fuzzy Sets. T. Rama Rao, Ch. Prabhakara Rao, Dawit Solomon And Derso Abeje.

Likewise, properties of the optimal policy for equipment replacement & maintenance problems can be used to reduce the computation.

EECE 301 Signals & Systems

Chapter 8: Statistical Analysis of Simulated Data

ECONOMETRIC THEORY. MODULE VIII Lecture - 26 Heteroskedasticity

THE COMPLETE ENUMERATION OF FINITE GROUPS OF THE FORM R 2 i ={R i R j ) k -i=i

Lecture 3. Sampling, sampling distributions, and parameter estimation

Beam Warming Second-Order Upwind Method

A BASIS OF THE GROUP OF PRIMITIVE ALMOST PYTHAGOREAN TRIPLES

PROJECTION PROBLEM FOR REGULAR POLYGONS

Lecture Notes Types of economic variables

Taylor s Series and Interpolation. Interpolation & Curve-fitting. CIS Interpolation. Basic Scenario. Taylor Series interpolates at a specific

Mu Sequences/Series Solutions National Convention 2014

Ahmed Elgamal. MDOF Systems & Modal Analysis

Fibonacci Identities as Binomial Sums

Lecture 2 - What are component and system reliability and how it can be improved?

Factorization of Finite Abelian Groups

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then

Assignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)

A New Method for Decision Making Based on Soft Matrix Theory

III-16 G. Brief Review of Grand Orthogonality Theorem and impact on Representations (Γ i ) l i = h n = number of irreducible representations.

2. Independence and Bernoulli Trials

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

The Selection Problem - Variable Size Decrease/Conquer (Practice with algorithm analysis)

Chapter 14 Logistic Regression Models

MOLECULAR VIBRATIONS

Unimodality Tests for Global Optimization of Single Variable Functions Using Statistical Methods

A tighter lower bound on the circuit size of the hardest Boolean functions

Lattices. Mathematical background

A conic cutting surface method for linear-quadraticsemidefinite

Simple Linear Regression

Chapter 3. Linear Equations and Matrices

Multiple Regression. More than 2 variables! Grade on Final. Multiple Regression 11/21/2012. Exam 2 Grades. Exam 2 Re-grades

2SLS Estimates ECON In this case, begin with the assumption that E[ i

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

Ordinary Least Squares Regression. Simple Regression. Algebra and Assumptions.

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights

Dimensionality Reduction and Learning

MA/CSSE 473 Day 27. Dynamic programming

Generalization of the Dissimilarity Measure of Fuzzy Sets

Application of Legendre Bernstein basis transformations to degree elevation and degree reduction

10.1 Approximation Algorithms

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Lecture 5: Interpolation. Polynomial interpolation Rational approximation

h-analogue of Fibonacci Numbers

1. Overview of basic probability

Assignment 7/MATH 247/Winter, 2010 Due: Friday, March 19. Powers of a square matrix

7.0 Equality Contraints: Lagrange Multipliers

PTAS for Bin-Packing

Chapter 5 Properties of a Random Sample

LINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)

Transcription:

Researcher: Taylor Dupuy Advsor: Aaro Wootto Semester: Fall 4 Ivestgatg Cellular Automata A Overvew of Cellular Automata: Cellular Automata are smple computer programs that geerate rows of black ad whte cells based o rules whch update each cell based o ts eghborg cells. A example of ths would be a cellular automata havg a row cotag oe black cell surrouded by two whte cells where ths specfc automata t has a rule that says for each cell of ths type, that s, for each black cell surrouded by two whte cells t wll be updated to a black cell the ext row. Rules lke ths for all possble codtos whch are defed exhaustvely. A example of a cellular automata rule 3 s show below. The box drectly below ths text depcts the rules by whch the cellular automata s updated. The mage below ad to the left depcts the cells beg updated step by step for the frst fve steps. The mage to the rght depcts the evoluto of cellular automata rule3 after steps. A terestg fact about rule 3 s the that the ceter colum of rule 3 has passed every radomess test t has goe through ad that t s fact s used the radom umber geerator for Stephe Wolfram s Mathematca program ever sce the program s cepto. Uversalty s the property of beg able to perform dfferet tasks wth the same uderlyg costructo by beg programmed a dfferet way. 3 I pla Eglsh ths s to say that a computer program, upo gvg t dfferet tal codtos, wll perform tasks that mmc aother computer program the same way the program whch t s Namg scheme: readg the bottom row from rght to left we have bary + 4 + 8 +6 whch s equal to 3. Also ote that from rght to left the tal codtos for whch the gve rule are appled also go from to 7 bary. These ad more mages ca be foud at http://wolframscece.com/dowloads/bascmages.html. 3 Weste, E http://mathworld.wolfram.com/uversalty.html

mmckg would costruct the sad costructo. I beleve t would be helpful to see a pcture of a uversal cellular automata whch wll llustrate the oto of uversalty better tha ay cofusg setece :-). 4 The above pcture shows a 9-color cellular automato wth sgfcatly more rules tha the elemetary cellular automata dscussed prevously. Nevertheless I thk the llustrato of the oto of uversalty s clear from these mages. I must ote that ths property of uversalty s ot lmted to cellular automata. The property of uversalty ca be foud Turg maches, tag-cyclc systems, ad regster maches, whch are other dealzed computatoal systems. Backgroud: I Stepha Wolfram of Wolfram Research publshed A New Kd of Scece a hstory ad vestgato of cellular automata ad other computatoal systems. The results preseted A New Kd of Scece are atypcal of a maor work because t does ot cota a formal mathematcal structure by whch the deas preseted the book are dscussed. After havg read A New Kd of Scece I developed a terest the mathematcal structure that les behd these dealzed computatoal systems. I wsh to expla why computato behaves a way t does. I wsh to expla formally why certa automata 4 Images take from http://mathworld.wolfram.com/uversalcellularautomato.html

have the property of uversalty or complexty, what propertes (rules) determe the behavor of the automata (complexty, ad uversalty). I order to do so, I beleve I eed to uderstad ad/or develop a mathematcal structure whch I may exame automata as a operato o a set. Because I m most famlar wth elemetary cellular automata, I wsh frst uderstad a partcular uversal elemetary automata, elemetary cellular automata. Rule s the smallest uversal system whch has bee show to be uversal. It was show to be uversal by both Cook 4 ad Wolfram. 5 At the ed of the semester I wsh to expla why rule s uversal ad be able to prove t formally. I ve commeted o the mathematcal structure below ad I must ote that my research wll clude fdg/uderstadg a rgorous represetato these operatos performed by dealzed computatoal systems. Structure: The structure whch oe ca represet a automata seems ot to be uque. I m cosderg represetg cellular automata as a set wth the operato o the set of the updatg rule for the partcular cellular automata. I ve show below a way of represetg a elemetary cellular automata a fte feld. Ths method below s ot ecessarly the oe I wll choose represetg the automata mdterm of fal reports. 5 Cook, M. "Uversalty Elemetary Cellular Automata." Complex Systems 5, -4, 4., Wolfram, S. A New Kd of Scece. Champag, IL: Wolfram Meda, pp. 64-644,.

. Defg Elemetary Automata over a Fte Feld: We shall call the black ad whte states elemets of a set B {, } whch we shall defe coucto wth operatos whch wll allows us to classfy ths set as a fte feld. If we have a cellular automata row wth compoets, or otrval rows we shall defe ths row as follows. r (,,, ) r b b b B where b, b,, b B. Ths allows us to use a vector space structure o the cellular automata ad we make wrte r as a lear combato of bass elemets Ad we wrte, (,,,), (,,,),, (,,,) e e e r be... Defg Automata Fucto: Our goal s to defe the geeralzed automata fucto A : B B + for whch we may take ay rules for a gve cellular automata ad use them to operate o the row as to defe the recurrece relato A r r ad. It s coveet at ths r for r B r B + pot to defe the fuctos for updatg each cell based o the adacet cells... Updatg Cells 3 We desre the fucto : B B. s defed exhaustvely, gvg all the cases for 3 each possble elemet B.,, (,, ) (,,) for,,, 7 B. Now order to get these sgle bt values to a form whch we k ca use we eed to do perform a trasformato φ k : B B whch maps the sgle bt k to a subspace of B wth the same dmeso (whch ths specfc case s, but whch could possble be geeralzed for other computatoal systems). Now all that s left s do t decostructo of some elemet of B to a form where we may apply the fucto ad the recostruct the compoets uder the mage to a B + vector space. 7

.. Applcato of alpha-fucto Allow us to decostruct 3 Let Ψ : B B defed by for β r to compoets whch wll be more useful our veture. Ψ ( r) β ( b, b+, b + ) ad let us create some β β β ( ( b,,) whch all ca be used to apply to part of b the mage of for p,,,, b,, b, b, b, b,), ad we get that ( ) β β β +. 6 B. Takg all Now applyg : + φ ( + ) B B to each,, + where φ ( + ) s defed by φ ( + ) (,,,,,,) thspot + terms β p uder we get compoets of Ar ( ) whch whe we take the sum of all of them we get Ar ( ). So we have Ar r where s gve by + φ ( + ) ( ) (,,, ) ( ( r )) Ψ. + 7 6 The sloppess of ths argumet s to be corrected 7 ote that ca also be as coeffcets for a lear combato of the bass elemets for a bass of B +.