Outline 2. 1 Elementary Cellular Automata. 2 Analysis of Cellular Automata. 3 A Huge Surprise. Generalizations? 4
|
|
- Malcolm Gregory
- 7 years ago
- Views:
Transcription
1 Outline 2 CDM Cellular Automata Klaus Sutner 1 Elementary Cellular Automata 2 Analysis of Cellular Automata Fall A Huge Surprise Recall: Feedback Shift-Registers 3 Generalizations? 4 r3 r2 r1 r0 So simple Boolean functions can create rather complicated and useful behavior when iterated. Can One Exploit This Phenomenon? c1 c2 c3 c4 Are there are other interesting systems of similar type? Can one develop a good theory of the systems? A few bit-registers and a simple feedback function. Iteration produces complicated and useful behavior: selecting the taps in a judicious manner, we can obtain bit-sequences with very long periods (near-hamiltonian sequences). Can they be used to solve computational tasks? Efficiently? We will consider one fairly straightforward generalization: linear cellular automata. Configurations 5 Localize 6 We start with a linear sequence of 1-bit registers, called cells in this context. Each cell communicates with its 2 immediate neighbors: To update a configuration X in position i we can only use the current values of the immediate neighbors of cell i: X i 1, X i, X i+1 X i r0 r1 r2 r3 r4 r5 r6 r7 Clearly we can describe this update operation by a ternary Boolean function ρ : A configuration of this system is an assignment of Boolean values to all the cells C, a map X : C 2 We write C for the space of all configurations. The idea is to apply this map at all cells to update a given configuration. First, a closer look at the cell layout.
2 A Taxonomy 7 Two-Way Infinite is Easier 8 In the picture we can think of C = {0, 1,..., n 1}. So, configurations are just finite bit sequences (or words if you like). But it also makes sense to consider C = N. In this case a configuration is an ω-sequence, a one-way infinite sequence. Lastly, we could have C = Z. In this case a configuration is a bi-infinite sequence, sometimes called a ζ-sequence. So there is a finite type, a (one-way) infinite type and a bi-infinite type. We have a local map ρ : that we need to extend to a global map G ρ : C C This is straightforward in the bi-infinite case: G ρ(x)(i) = ρ(x(i 1), X(i), X(i + 1)) In other words, apply the local map simultaneously (there is a global clock) and in parallel at all cells to get the next configuration. So this system is homogeneous: the same law applies everywhere. Elementary Cellular automata 9 Information Flow 10 So as a data structure, a one-dimensional, bi-infinite, elementary cellular automaton (ECA) is simply a ternary Boolean function. One-dimensional is clear: we are not dealing with higher dimensional grids. Bi-infinite : well... The elementary comes from the fact that we only consider Boolean values and immediate neighbors. Obviously one could use larger alphabets and/or larger neighborhoods. Pleasant Surprise: ECA already display many of the interesting features of these more complicated systems. Note that there is a speed of light in this system: information cannot propagate from instantaneously from a cell to a far-away cell: every cell has its own light cone. Einstein 11 Boundary Conditions 12 Cellular automata are often referred to as physics-like models of computation. By homogeneity, the laws of physics in a CA are the same everywhere. By locality, there is no spooky action at a distance. Since the local rule is deterministic, so is the whole system. Einstein might have liked cellular automata. Of course, to get something vaguely resembling some aspect of physics one needs to deal with 2-dim or 3-dim cellular automata. For example, there are interesting ways to simulate fluid-dynamics. And we have to ignore quantum physics. Note that our definition of the global map does not directly apply to (one-way) infinite and finite grids of cells: the border cells don t have enough neighbors. There are two standard solutions (and variations thereof): Fixed boundary conditions: assume there is another cell in state 0. This works for infinite and finite grids. Cyclic boundary conditions: assume the grid wraps around (circle of cells). This only works for finite grids. We will use cyclic boundary conditions unless mentioned otherwise.
3 Cellular Automata 13 Ranking ECA 14 So, in order to specify a general (one-dimensional, elementary) cellular automaton we need the following information: the local map ρ, a ternary Boolean function a description of the grid topology for the infinite/finite case a specification of boundary conditions. It is not too surprising that the critical part is the Boolean function, the topology does not matter that much (for some definition of much ). So we are dealing with 256 basic ECA, plus variants. Since every ternary Boolean function is given by its list of values, eight bits a 0, a 1,..., a 7 we can think of these bits as a number written in reverse binary. For example, ECA number 160 corresponds to (0, 0, 0, 0, 0, 1, 0, 1). Less cryptically, the local map is ρ(x, y, z) = x z Go to WolframAlpha to see the Boolean functions corresponding to the 256 ECA. Additive ECA 15 ECA Recall that we started with feedback shift registers which are based on exclusive or. One might wonder what happens when the local map of a ECA is based on xor. There are two interesting cases: rule 90 and 150 ρ 90(x, y, z) = x z ρ 150(x, y, z) = x y z It is easy to see that in this case the global map is also linear with respect to F 2: G ρ(x + Y ) = G ρ(x) + G ρ(y ). So it suffices in a sense to understand their behavior on one-point configurations (corresponding to unit vectors). Alas, linear in connection with CA means one-dimensional. So, these rules are called additive. ECA Exercise 18 Exercise Compute the fractal dimension of the pattern generated by ECA 90. Exercise Give a real proof that your computation is correct. Exercise Compute the fractal dimension of the pattern generated by ECA 150. Exercise Give a real proof that your computation is correct.
4 Typical Pictures 20 Elementary Cellular Automata 2 Analysis of Cellular Automata A Huge Surprise Wolfram s Classes 21 Automatic Classification 22 A characterization based on heuristics (aka looking at pictures). W1: Evolution leads to homogeneous fixed points. W2: Evolution leads to periodic configurations. W3: Evolution leads to chaotic, aperiodic patterns. W4: Evolution produces persistent, complex patterns of localized structures. Since there are lots of CA (if we drop the constraint of being elementary) it would be very nice to have automatic tools to check their properties. Amoroso and Patt 1972: decidability of reversibility and surjectivity. KS 1991: efficient quadratic time algorithm, automata theory. J. Kari 1990: undecidable in dimensions 2 and higher. Bad News 23 Local Theory 24 Stronger classifications along the lines of Wolfram s Classes are quite hopeless. Theorem It is Π 2-complete to test if all orbits end in fixed points. Theorem It is Σ 3-complete to test if all orbits are decidable. Theorem It is Σ 4-complete to test if a CA is computationally universal. If orbits are too complicated, maybe one can still handle weaker properties, just like injectivity and surjectivity. Think of a cellular automaton as a first-order structure: A ρ = C, where the configurations C are words (finite, infinite, bi-infinite) and X Y indicates that G ρ(x) = Y.
5 Keeping Things Simple 25 Some Formulae 26 FOL can only handle boundedly many applications of the global map, so in a sense we are looking at local properties of A. x y (y x) x, y, z (x z y z x = y) x y, z (y x z x u (u x u = y u = z)) But these require stronger logic (MSO,TrCL,... ): x (x 0) x z (x z z z) Decidability 27 The Spectrum 28 Theorem The first-order theory of one-dimensional cellular automata is decidable. For finite CA one needs to be a bit careful, we have to deal with additional parameter n. Ideally, given any sentence ϕ, we would like to understand its spectrum: Unfortunately, the complexity is not elementary: nested complementation wreaks havoc on efficiency. spec(ϕ) = { n N A n ρ = ϕ } There are tricks that can help, bug the sad truth is that only a tiny fragment of first-order logic is decidable in the real world. So spec(ϕ) = N means always true, spec(ϕ) = means always false. Regular Spectra 29 Graphical Computing 30 ECA 90: spec(injective) =. ECA 154: spec(injective) = odd. ECA 150: spec(injective) = N 3N. So how does one analyze ECAs? One important method is simulation: compute the orbit of some/all configurations on finite grids of different sizes. Plot a 2-dimensional picture of these orbits and hope to find some patterns by visual inspection. Theorem Spectra are regular: the language { 0 n n spec(ϕ) } is regular. Moreover, a corresponding finite automaton can be constructed effectively. We can also look at phasespace, the directed graph obtained from the global map applied to all configurations of some rather limited size. For larger configurations we can only sample. Of course, in the end pictures mean little: one has to be able to turn the pictures into theorems. Alas, it can be a long, long way from pretty pictures to a theorem.
6 Example: ECA ECA Transients 33 Line of Attack 34 A table of all transient/period pairs, and the number of configurations that attain them. t p count t p count Probably not a good idea to try to find a closed form for the actual counts, but the length of the transients should be OK. Also note that long transients seem to lead to fixed points. Every configuration in C n other than 0 can be written in the form where n = k i=1 (ni + 1) and 1 k. X = 10 n1 10 n n k 1 10 n k Then the transient is essentially max n i and the period is 1 or 2 essentially depending on the parity of the n i. Note the qualifier essentially, things are bit more complicated than that (one has to deal with special cases for small values of n i). Exercise Carry out the details of this argument. Make sure to verify your results experimentally. ECA But be warned, things do not always work out so nicely. How about this one? Multiple Seeds 36 Apparently not bad. More complicated seeds don t seem to cause too much trouble, either.
7 Disaster 37 ECA Another apparently hopeless case. n = 23, t = 24, p = 690 The entry point to the limit cycle is marked in purple (first and last column). ECA Pseudo-Random Bits 40 This one seems even more intimidating. Feedback-shift registers can be used to produce cheap pseudo-random bits. Is there an ECA that could produce reasonable pseudo-random bits? One might suspect that binary nearest neighbor CA are too restricted to produce anything useful. But actually there is a candidate: ECA number 30. This CA was used in the Connection Machine as a PRN generator and is still used in Mathematica. ECA ECA 30 42
8 Computation and CA 44 Elementary Cellular Automata Analysis of Cellular Automata In the glory days when people were building actual CA hardware one could use these CA-machines to do simulations in physics. Of course, without massively parallel hardware CA are not a particularly useful model. But how about other computations? Is there anything one can do nicely on a CA, not necessarily an elementary one? 3 A Huge Surprise For example, how about the most basic non-regular language, the Dyck language of balanced parentheses? Computing By Pictures 45 The Local Map 46 For convenience, use a three-symbol alphabet Σ = {L, R, b} where b stands for blank, L for ( and R for ). The basic idea is very simple: LR turns into bb: matching parens disappear. br turns into Rb: a right paren moves left in free space. Everything else does not change. This can be handled by a width 3, 3 state CA. Here is the local replacement rule (where means any symbol). (, L, R) b (L, R, ) b (, b, R) R (b, R, ) b (, x, ) x Using the standard ranking this is (3, 3)-CA number An Accepting Computation 47 Two Non-Accepting Computations 48 Correctness proof by picture. Both computations below fail, but for different reasons. On the left: unmatched right parens, on the right unmatched left parens. Here blue is L, red is R.
9 Majority 49 Majority CA 50 Here is another simple task: build a CA that determines Majority. In other words, the CA should be able to detect whether a given binary input configuration has more 0 s or more 1 s (lets assume we are working on a grid of odd length). As usual, it is not clear how the CA should signal it s output, so let s agree to the following. If the input configuration has more 1 s than 0 s, evolve to all 1 s. Otherwise evolve to all 0 s. Here is the catch: the CA itself should also be binary. Clearly, width 3 won t go very far here, so one typically uses a neighborhood of size 7: there are such CAs, perhaps one of them will work. Standard application of genetic programming. Firing Squad Problems 51 Moews 52 Here is a type of computation more closely linked to multiple-processor devices: what is the best way to synchronize all the processors in a one-dimensional grid when communication is strictly local? In the classical form of the FSP we have n soldiers lined up, but the number n is unknown to them. At time 0 soldier number 1 (the general) is in a special state, all others are quiescent. At time t all soldiers are in a special firing state, and no one has been in the firing state at any time prior to t. It is not hard to come up with solutions if each soldier is allowed to have many internal states the hard part is to have few states and keep t small. A width 3 CA with 13 states. Note the signal used to partition the line into smaller and smaller blocks. Waksman 53 Mazoyer 54 A width 3 CA with 9 states. Again width 3 but only 6 states.
10 Universal Computation 55 Intrinsically Universal CA 56 So we can build certain cellular automata for special purpose computations, but how about a universal computer? A cellular automaton that can simulate any Turing machine? Actually, slightly more ambitious: a cellular automaton that can simulate any other CA? These are called intrinsically universal cellular automata. This may sound hard, but it s actually not that bad: it is trivial to simulate a Turing machine by a one-dimensional CA. And with more sweat, we can simulate arbitrary CAs on an appropriately constructed one. So we get universal computation. An example of an intrinsically universal CA, simulating ECA 90. It uses k = 19 and w = 5. Langton s CA 57 Zoom 58 Zoom 59 Zoom 60
11 The Real Question 61 ECA More interesting is this question: how small can the neighborhood and alphabet be to get universality? The intrinsically universal one was constructed, every part of the local rule is carefully planned. Langton s machine was discovered in the sense that he searched through lots of machines on 8 states and width 5. It looks universal, but no one has a proof. Wild Idea: Could there possibly be an elementary cellular automaton that is universal? ECA A Huge Surprise 64 Theorem (Cook) Elementary cellular automaton number 110 is universal. Of course, the computation is very slow, and the initial configuration horribly complicated. This is the first example of a small universal machine that was discovered, not constructed. One technical complication: this only works for configurations of the form ω u w v ω The details are quite messy, see Cook s paper in Complex Systems. By now the proof has undergone enough scrutiny to be generally accepted as correct. It cannot be verified by a proof checker at this point, though. Incidentally, it seems that rule 110 is not intrinsically universal.
CDM. Cellular Automata
CDM Cellular Automata Klaus Sutner Fall 2013 Outline 2 1 Elementary Cellular Automata 2 Analysis of Cellular Automata 3 A Huge Surprise Recall: Feedback Shift-Registers 3 r 3 r 2 r 1 r 0 c 1 c 2 c 3 c
More informationReliably computing cellular automaton, in 1-sparse noise
Reliably computing cellular automaton, in 1-sparse noise Peter Gács Boston University Peter Gács (Boston University) TRG Spring 2010 1 / 23 Ths is the second one of a series of three lectures on reliable
More informationRepresenting Reversible Cellular Automata with Reversible Block Cellular Automata
Discrete Mathematics and Theoretical Computer Science Proceedings AA (DM-CCG), 2001, 145 154 Representing Reversible Cellular Automata with Reversible Block Cellular Automata Jérôme Durand-Lose Laboratoire
More informationCAs and Turing Machines. The Basis for Universal Computation
CAs and Turing Machines The Basis for Universal Computation What We Mean By Universal When we claim universal computation we mean that the CA is capable of calculating anything that could possibly be calculated*.
More informationNotes on Complexity Theory Last updated: August, 2011. Lecture 1
Notes on Complexity Theory Last updated: August, 2011 Jonathan Katz Lecture 1 1 Turing Machines I assume that most students have encountered Turing machines before. (Students who have not may want to look
More informationCELLULAR AUTOMATA AND APPLICATIONS. 1. Introduction. This paper is a study of cellular automata as computational programs
CELLULAR AUTOMATA AND APPLICATIONS GAVIN ANDREWS 1. Introduction This paper is a study of cellular automata as computational programs and their remarkable ability to create complex behavior from simple
More informationGenetic Algorithm Evolution of Cellular Automata Rules for Complex Binary Sequence Prediction
Brill Academic Publishers P.O. Box 9000, 2300 PA Leiden, The Netherlands Lecture Series on Computer and Computational Sciences Volume 1, 2005, pp. 1-6 Genetic Algorithm Evolution of Cellular Automata Rules
More informationPolynomial Invariants
Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y,
More information6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationT-79.186 Reactive Systems: Introduction and Finite State Automata
T-79.186 Reactive Systems: Introduction and Finite State Automata Timo Latvala 14.1.2004 Reactive Systems: Introduction and Finite State Automata 1-1 Reactive Systems Reactive systems are a class of software
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More information6.080/6.089 GITCS Feb 12, 2008. Lecture 3
6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my
More informationCSE 135: Introduction to Theory of Computation Decidability and Recognizability
CSE 135: Introduction to Theory of Computation Decidability and Recognizability Sungjin Im University of California, Merced 04-28, 30-2014 High-Level Descriptions of Computation Instead of giving a Turing
More informationHonors Class (Foundations of) Informatics. Tom Verhoeff. Department of Mathematics & Computer Science Software Engineering & Technology
Honors Class (Foundations of) Informatics Tom Verhoeff Department of Mathematics & Computer Science Software Engineering & Technology www.win.tue.nl/~wstomv/edu/hci c 2011, T. Verhoeff @ TUE.NL 1/20 Information
More informationLecture 2: Universality
CS 710: Complexity Theory 1/21/2010 Lecture 2: Universality Instructor: Dieter van Melkebeek Scribe: Tyson Williams In this lecture, we introduce the notion of a universal machine, develop efficient universal
More informationAutomata and Computability. Solutions to Exercises
Automata and Computability Solutions to Exercises Fall 25 Alexis Maciel Department of Computer Science Clarkson University Copyright c 25 Alexis Maciel ii Contents Preface vii Introduction 2 Finite Automata
More informationProperties of Stabilizing Computations
Theory and Applications of Mathematics & Computer Science 5 (1) (2015) 71 93 Properties of Stabilizing Computations Mark Burgin a a University of California, Los Angeles 405 Hilgard Ave. Los Angeles, CA
More informationCS 3719 (Theory of Computation and Algorithms) Lecture 4
CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a
More informationTesting LTL Formula Translation into Büchi Automata
Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN-02015 HUT, Finland
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationThe Classes P and NP
The Classes P and NP We now shift gears slightly and restrict our attention to the examination of two families of problems which are very important to computer scientists. These families constitute the
More informationOutline 2. 1 Turing Machines. 2 Coding and Universality. 3 The Busy Beaver Problem. 4 Wolfram Prize. 5 Church-Turing Thesis.
Outline 2 CDM Turing Machines Turing Machines 2 Coding and Universality Klaus Sutner Carnegie Mellon University 3-turing-mach 205/8/30 9:46 3 The Busy Beaver Problem 4 Wolfram Prize 5 Church-Turing Thesis
More informationMethods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
More informationThe Halting Problem is Undecidable
185 Corollary G = { M, w w L(M) } is not Turing-recognizable. Proof. = ERR, where ERR is the easy to decide language: ERR = { x { 0, 1 }* x does not have a prefix that is a valid code for a Turing machine
More informationDecentralized Method for Traffic Monitoring
Decentralized Method for Traffic Monitoring Guillaume Sartoretti 1,2, Jean-Luc Falcone 1, Bastien Chopard 1, and Martin Gander 2 1 Computer Science Department 2 Department of Mathematics, University of
More informationI d Rather Stay Stupid: The Advantage of Having Low Utility
I d Rather Stay Stupid: The Advantage of Having Low Utility Lior Seeman Department of Computer Science Cornell University lseeman@cs.cornell.edu Abstract Motivated by cost of computation in game theory,
More informationYear 9 set 1 Mathematics notes, to accompany the 9H book.
Part 1: Year 9 set 1 Mathematics notes, to accompany the 9H book. equations 1. (p.1), 1.6 (p. 44), 4.6 (p.196) sequences 3. (p.115) Pupils use the Elmwood Press Essential Maths book by David Raymer (9H
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationReading 13 : Finite State Automata and Regular Expressions
CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model
More informationRuntime Verification - Monitor-oriented Programming - Monitor-based Runtime Reflection
Runtime Verification - Monitor-oriented Programming - Monitor-based Runtime Reflection Martin Leucker Technische Universität München (joint work with Andreas Bauer, Christian Schallhart et. al) FLACOS
More informationArrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,
More informationAutomata and Formal Languages
Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,
More information6 Scalar, Stochastic, Discrete Dynamic Systems
47 6 Scalar, Stochastic, Discrete Dynamic Systems Consider modeling a population of sand-hill cranes in year n by the first-order, deterministic recurrence equation y(n + 1) = Ry(n) where R = 1 + r = 1
More information(IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems.
3130CIT: Theory of Computation Turing machines and undecidability (IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems. An undecidable problem
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationArtificial Neural Networks and Support Vector Machines. CS 486/686: Introduction to Artificial Intelligence
Artificial Neural Networks and Support Vector Machines CS 486/686: Introduction to Artificial Intelligence 1 Outline What is a Neural Network? - Perceptron learners - Multi-layer networks What is a Support
More informationSystem Interconnect Architectures. Goals and Analysis. Network Properties and Routing. Terminology - 2. Terminology - 1
System Interconnect Architectures CSCI 8150 Advanced Computer Architecture Hwang, Chapter 2 Program and Network Properties 2.4 System Interconnect Architectures Direct networks for static connections Indirect
More informationFactoring & Primality
Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount
More informationCHAPTER 3 Boolean Algebra and Digital Logic
CHAPTER 3 Boolean Algebra and Digital Logic 3.1 Introduction 121 3.2 Boolean Algebra 122 3.2.1 Boolean Expressions 123 3.2.2 Boolean Identities 124 3.2.3 Simplification of Boolean Expressions 126 3.2.4
More information6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, 2010. Class 4 Nancy Lynch
6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, 2010 Class 4 Nancy Lynch Today Two more models of computation: Nondeterministic Finite Automata (NFAs)
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationSome Minesweeper Configurations
Some Minesweeper Configurations Richard Kaye School of Mathematics The University of Birmingham Birmingham B15 2TT RWKaye@bhamacuk http://webmatbhamacuk/rwkaye/ 31st May 2007 Contents 1 Introduction 2
More information3515ICT Theory of Computation Turing Machines
Griffith University 3515ICT Theory of Computation Turing Machines (Based loosely on slides by Harald Søndergaard of The University of Melbourne) 9-0 Overview Turing machines: a general model of computation
More informationLecture 8: Synchronous Digital Systems
Lecture 8: Synchronous Digital Systems The distinguishing feature of a synchronous digital system is that the circuit only changes in response to a system clock. For example, consider the edge triggered
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More information14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO)
Overview Kyrre Glette kyrrehg@ifi INF3490 Swarm Intelligence Particle Swarm Optimization Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) 3 Swarms in nature Fish, birds,
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationPushdown Automata. place the input head on the leftmost input symbol. while symbol read = b and pile contains discs advance head remove disc from pile
Pushdown Automata In the last section we found that restricting the computational power of computing devices produced solvable decision problems for the class of sets accepted by finite automata. But along
More informationIntroduction. What is RAID? The Array and RAID Controller Concept. Click here to print this article. Re-Printed From SLCentral
Click here to print this article. Re-Printed From SLCentral RAID: An In-Depth Guide To RAID Technology Author: Tom Solinap Date Posted: January 24th, 2001 URL: http://www.slcentral.com/articles/01/1/raid
More informationwith functions, expressions and equations which follow in units 3 and 4.
Grade 8 Overview View unit yearlong overview here The unit design was created in line with the areas of focus for grade 8 Mathematics as identified by the Common Core State Standards and the PARCC Model
More informationGraph Theory Problems and Solutions
raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is
More informationInkrementell vekst av genomet for evolusjon av genotype representasjoner for kunstige cellulære organismer.
Inkrementell vekst av genomet for evolusjon av genotype representasjoner for kunstige cellulære organismer. Andreas Giskeødegård Master i datateknikk Innlevert: juni 2013 Hovedveileder: Gunnar Tufte, IDI
More informationSudoku puzzles and how to solve them
Sudoku puzzles and how to solve them Andries E. Brouwer 2006-05-31 1 Sudoku Figure 1: Two puzzles the second one is difficult A Sudoku puzzle (of classical type ) consists of a 9-by-9 matrix partitioned
More informationRegular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a
More informationCS154. Turing Machines. Turing Machine. Turing Machines versus DFAs FINITE STATE CONTROL AI N P U T INFINITE TAPE. read write move.
CS54 Turing Machines Turing Machine q 0 AI N P U T IN TAPE read write move read write move Language = {0} q This Turing machine recognizes the language {0} Turing Machines versus DFAs TM can both write
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationIntroduction to nonparametric regression: Least squares vs. Nearest neighbors
Introduction to nonparametric regression: Least squares vs. Nearest neighbors Patrick Breheny October 30 Patrick Breheny STA 621: Nonparametric Statistics 1/16 Introduction For the remainder of the course,
More informationCellular Automaton: The Roulette Wheel and the Landscape Effect
Cellular Automaton: The Roulette Wheel and the Landscape Effect Ioan Hălălae Faculty of Engineering, Eftimie Murgu University, Traian Vuia Square 1-4, 385 Reşiţa, Romania Phone: +40 255 210227, Fax: +40
More informationALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite
ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,
More informationScicos is a Scilab toolbox included in the Scilab package. The Scicos editor can be opened by the scicos command
7 Getting Started 7.1 Construction of a Simple Diagram Scicos contains a graphical editor that can be used to construct block diagram models of dynamical systems. The blocks can come from various palettes
More information(Refer Slide Time: 2:03)
Control Engineering Prof. Madan Gopal Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 11 Models of Industrial Control Devices and Systems (Contd.) Last time we were
More informationRemarks on the computational complexity of small universal Turing machines
Remarks on the computational complexity of small universal Turing machines Damien Woods School of Mathematics Boole Centre for Research in Informatics, University College Cork, Ireland http://www.bcri.ucc.ie/
More informationTuring Machines: An Introduction
CIT 596 Theory of Computation 1 We have seen several abstract models of computing devices: Deterministic Finite Automata, Nondeterministic Finite Automata, Nondeterministic Finite Automata with ɛ-transitions,
More informationComplexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar
Complexity Theory IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Outline Goals Computation of Problems Concepts and Definitions Complexity Classes and Problems Polynomial Time Reductions Examples
More informationComputability Theory
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Computability Theory This section is partly inspired by the material in A Course in Mathematical Logic by Bell and Machover, Chap 6, sections 1-10.
More informationIntroduction to computer science
Introduction to computer science Michael A. Nielsen University of Queensland Goals: 1. Introduce the notion of the computational complexity of a problem, and define the major computational complexity classes.
More informationIntroduction to the Smith Chart for the MSA Sam Wetterlin 10/12/09 Z +
Introduction to the Smith Chart for the MSA Sam Wetterlin 10/12/09 Quick Review of Reflection Coefficient The Smith chart is a method of graphing reflection coefficients and impedance, and is often useful
More informationNP-Completeness I. Lecture 19. 19.1 Overview. 19.2 Introduction: Reduction and Expressiveness
Lecture 19 NP-Completeness I 19.1 Overview In the past few lectures we have looked at increasingly more expressive problems that we were able to solve using efficient algorithms. In this lecture we introduce
More informationLecture 3: Linear methods for classification
Lecture 3: Linear methods for classification Rafael A. Irizarry and Hector Corrada Bravo February, 2010 Today we describe four specific algorithms useful for classification problems: linear regression,
More informationSECTION 5: Finalizing Your Workbook
SECTION 5: Finalizing Your Workbook In this section you will learn how to: Protect a workbook Protect a sheet Protect Excel files Unlock cells Use the document inspector Use the compatibility checker Mark
More informationEncoding Text with a Small Alphabet
Chapter 2 Encoding Text with a Small Alphabet Given the nature of the Internet, we can break the process of understanding how information is transmitted into two components. First, we have to figure out
More informationIntroduction to Logic in Computer Science: Autumn 2006
Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Now that we have a basic understanding
More informationC H A P T E R Regular Expressions regular expression
7 CHAPTER Regular Expressions Most programmers and other power-users of computer systems have used tools that match text patterns. You may have used a Web search engine with a pattern like travel cancun
More informationThree Effective Top-Down Clustering Algorithms for Location Database Systems
Three Effective Top-Down Clustering Algorithms for Location Database Systems Kwang-Jo Lee and Sung-Bong Yang Department of Computer Science, Yonsei University, Seoul, Republic of Korea {kjlee5435, yang}@cs.yonsei.ac.kr
More informationScheduling. Getting Started. Scheduling 79
Scheduling 9 Scheduling An event planner has to juggle many workers completing different tasks, some of which must be completed before others can begin. For example, the banquet tables would need to be
More informationNP-Completeness and Cook s Theorem
NP-Completeness and Cook s Theorem Lecture notes for COM3412 Logic and Computation 15th January 2002 1 NP decision problems The decision problem D L for a formal language L Σ is the computational task:
More informationAutomata-based Verification - I
CS3172: Advanced Algorithms Automata-based Verification - I Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2006 Supporting and Background Material Copies of key slides (already
More informationChapter 6: Episode discovery process
Chapter 6: Episode discovery process Algorithmic Methods of Data Mining, Fall 2005, Chapter 6: Episode discovery process 1 6. Episode discovery process The knowledge discovery process KDD process of analyzing
More informationThe components. E3: Digital electronics. Goals:
E3: Digital electronics Goals: Basic understanding of logic circuits. Become familiar with the most common digital components and their use. Equipment: 1 st. LED bridge 1 st. 7-segment display. 2 st. IC
More informationSeveral Views of Support Vector Machines
Several Views of Support Vector Machines Ryan M. Rifkin Honda Research Institute USA, Inc. Human Intention Understanding Group 2007 Tikhonov Regularization We are considering algorithms of the form min
More informationBOOLEAN ALGEBRA & LOGIC GATES
BOOLEAN ALGEBRA & LOGIC GATES Logic gates are electronic circuits that can be used to implement the most elementary logic expressions, also known as Boolean expressions. The logic gate is the most basic
More informationLinear Codes. Chapter 3. 3.1 Basics
Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length
More informationCOMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012
Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about
More informationCHAPTER 5 Round-off errors
CHAPTER 5 Round-off errors In the two previous chapters we have seen how numbers can be represented in the binary numeral system and how this is the basis for representing numbers in computers. Since any
More informationTheory of Computation Chapter 2: Turing Machines
Theory of Computation Chapter 2: Turing Machines Guan-Shieng Huang Feb. 24, 2003 Feb. 19, 2006 0-0 Turing Machine δ K 0111000a 01bb 1 Definition of TMs A Turing Machine is a quadruple M = (K, Σ, δ, s),
More informationMemory Allocation Technique for Segregated Free List Based on Genetic Algorithm
Journal of Al-Nahrain University Vol.15 (2), June, 2012, pp.161-168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, College
More informationCALCULATIONS & STATISTICS
CALCULATIONS & STATISTICS CALCULATION OF SCORES Conversion of 1-5 scale to 0-100 scores When you look at your report, you will notice that the scores are reported on a 0-100 scale, even though respondents
More informationModels of Sequential Computation
Models of Sequential Computation 13 C H A P T E R Programming is often considered as an art, but it raises mostly practical questions like which language should I choose, which algorithm is adequate, and
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationLinear Programming. Solving LP Models Using MS Excel, 18
SUPPLEMENT TO CHAPTER SIX Linear Programming SUPPLEMENT OUTLINE Introduction, 2 Linear Programming Models, 2 Model Formulation, 4 Graphical Linear Programming, 5 Outline of Graphical Procedure, 5 Plotting
More informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
More informationCompetitive Analysis of On line Randomized Call Control in Cellular Networks
Competitive Analysis of On line Randomized Call Control in Cellular Networks Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou Abstract In this paper we address an important communication issue arising
More informationThe fundamental question in economics is 2. Consumer Preferences
A Theory of Consumer Behavior Preliminaries 1. Introduction The fundamental question in economics is 2. Consumer Preferences Given limited resources, how are goods and service allocated? 1 3. Indifference
More informationSystolic Computing. Fundamentals
Systolic Computing Fundamentals Motivations for Systolic Processing PARALLEL ALGORITHMS WHICH MODEL OF COMPUTATION IS THE BETTER TO USE? HOW MUCH TIME WE EXPECT TO SAVE USING A PARALLEL ALGORITHM? HOW
More informationFORDHAM UNIVERSITY CISC 3593. Dept. of Computer and Info. Science Spring, 2011. Lab 2. The Full-Adder
FORDHAM UNIVERSITY CISC 3593 Fordham College Lincoln Center Computer Organization Dept. of Computer and Info. Science Spring, 2011 Lab 2 The Full-Adder 1 Introduction In this lab, the student will construct
More informationSession 7 Bivariate Data and Analysis
Session 7 Bivariate Data and Analysis Key Terms for This Session Previously Introduced mean standard deviation New in This Session association bivariate analysis contingency table co-variation least squares
More information