DOCSLIB.ORG

Turing Machines with Restricted Memory Access $

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Turing Machines with Restricted Memory Access $ INFORMATION AND CONTROL 9, 364--379 (1966) Turing Machines with Restricted Memory Access$ PATRICK C. FISCHER Department of Computer Science, Cornell University, Tthaca, New York Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores are investigated. The memory ac- cess restrictions arc produced by regarding the machines as small computers (as in the formalism of Wang) and by restricting the in- struction repertoires. Relationships are given linking machines which only accept or reject inputs and machines which emit output sequences as a function of their input. It is shown that without re- strictions on computing time or amount of tape used that only six distinct classes of sets of strings (languages) are produced by the above memory access restrictions. INTRODUCTION The theory of abstract machines has been well developed for the finite-state automaton and the Turing machine (McCarthy, 1959; Schutzenberger, 1963). Recently, machines more general than finite automata and less general than Turing machines have been investi- gated. One such family of intermediate machines consists of machines which have some form of unbounded memory so that they have more potential computing ability than the finite automata, but which have their access to the unbounded memory restricted in some way so that they do not have the full computing power of a Turing machine. The two kinds of restricted unbounded storage to be considered here are the counter and the pushdown store. A counter is a memory device containing a single nonnegative integer. The value of a counter can be increased by one, decreased by one (if nonzero), or tested for zero by the finite-state part (control unit) of the machine. A pushdown store * A summary of the results in this paper was presented at the Fourth Annual Symposium on Switching Circuit Theory and Logical Design under the title "On Computab~ility by Certain Classes of Restricted Turing Machines" (Fischer, 1963). Preparation of this manuscript was supported by National Science Founda- tion Grant GP-2880 and by the Division of Engineering and Applied Physics, Harvard University. The author is indebted to the referee for his very careful reading of this paper and his suggestions. 364 TURING MACHINES WITFI RESTRICTED MEMORY ACCESS 365 is a stack from which information can only be retrieved on a last-in-first- out basis. (One may note that a counter may be regarded as a pushdown store with a speciM symbol at the bottom of the stack and only l's elsewhere, the number of l's being the value of the counter.) Abstract machines are sometimes regarded as devices which simply accept or reject input strings of symbols and sometimes viewed as idealized computers which take a given input and emit output as a function of the input. The former will be called aeeeptors and the latter transducers. If the action of a machine is uniquely determined by its in- ternal configuration at each time t, the machine will be called determi- nistic; if it has several alternative actions at some time t, it will be called nondeterministic. Unlike a probabilistic machine, no numerical weights are attached to the alternative choices of a nondeterministie machine. In considering a nondeterministic computation, one is interested only in whether or not there exists a possible sequence of choices of alterna- tive actions which yields the desired end result. With the variety of machines given above, one could take a given set S of strings of symbols and ask whether or not it is: (1) accepted by an aeceptor, i.e., given as input to a computation which terminates with the machine in one of a designated set of "ac- cepting" states. (2) the input to a successful computation by a deterministic trans- ducer, i.e., the input to a computation which terminates with the ma- chine in one of a designated set of "successful" states. (3) the output of a successful computation by a deterministic trans- ducer. Furthermore, the machine associated with S could be: (a) a finite-state machine (b) u machine with one counter (c) a machine with one pushdown store (d) a machine with two counters (e) a machine with one counter and one pushdown store (f) a machine with two pushdown stores (g) a machine with some combination of three or more counters and/or pushdown stores (h) an unrestricted Turing machine and it could be either deterministic or nondeterministie. As an example, S might be accepted by a nondeterministic aceeptor with two counters but not be the output of any computation by a deterministic transducer with one pushdown store. Even if one disregards the infinitely many possibilities of ease (g) 366 rlsc~Ea and observes that reasonable definitions for cases (1) and (2) will render them equivalent (see Remark 1, below), the three-dimensional classi- fication above yields a potential 28 categories of machines and the sets of strings associated with them. It will be shown, however, that all of the possibilities above define only 6 distinct classes of sets of strings. This fact helps unify a small segment of the theory of abstract machines. A by-product of the presentation of the results of this paper will be the introduction of a formalism in which all of the memory-access-restricted machines discussed may be regarded as special cases of a multitape variant of Turing machines. NOTATION Let Z be a finite alphabet containing the symbols {B, 0, 1} and ~* be the set of all finite strings of members of ~. (Variables ranging over X will be denoted by z, T, 7, • • • with or without subscripts and variables over ~* will be denoted by x, y, z, • • • .) Let p be the mapping from ~* onto Z* taking x = z1~2 "" zn-lz,~ into p(x) = znz~_l --. z2z~ (and the empty word A into itself). To extend p to sets of strings let p(A) = {p(x) I x 6 A} for all A c ~*. The common notation of set theory will also be employed. GENElZAL MULTITAPE TURING MACHINES We will use the following definition of a multitape Turing machine. Features from the approaches of Post (as given by Davis) and Wang are used (Davis, 1958; Wang, 1957). DEFINITIO~ 1. An n-tape Turing machine ~ consists of n semi-infinite tapes which contain the symbol B (blank) in all but a finite number of squares, a finite set Q of internal states with distinguished elements qr and q~, and a set of quadruples of the form (q~, S, I, q~) where (1) q, 6 Q. (2) S is an n-tuple of members of ~. (3) I is of the form M~, M~(z), MJ, M~ t (z), W~(z), W~! (z), or N with 1=<- i =< nandzC Z. (4)q~ ~ Q. If no two distinct quadruples of ~)~ begin with the same q~ and S, then the machine will be called deterministic. Otherwise, it will be nonde- terministic. Informally, the operation of an n-tape machine is as follows. The input is placed on tape 1 and the machine is started in state qx • At any time TURING MACHINES WITH RESTRICTED 1V[EMORY ACCESS 367 t, if the machine is in state q~ and the symbols being scanned on tapes 1, 2, "" , n are ~1, ~, "'" , ~ respectively, and S = <~1, ~2, "'" , ~}, then if the machine contains the quadruple (q~, S, I, qj}, it may perform operation I and enter state qj. The effect of operation I will be: (1) If I = M~, the scanning head on tape i is moved one square to the right. (2) If I = M~(z) and if the symbol on the square to the right of the square being scanned on tape i is z, then the head for tape i is moved one square to the right. If the symbol in question is not z, then no action takes place and state qj is not entered. (3) If I = W~(z), the scanning head for tape i is moved one square to the right and the symbol z is then written on the new square. (4) If I = M~', M~'(z) or W~'((~), the action in (1), (2), or (3), re- spectively, is taken, but with "right" replaced by "left" in each case. (5) If I = N, no tape shifts or writing take place. If the computation eventually reaches qr, it is called successful, and the output (if any) appears on tape 2. We now give the formal version of the foregoing description. DEFINITION 2. An instantaneous description of an n-tape machine is an (n + 1)-tuple (q, T1, T~, • .. , Tn} where q C Q and T1, T2, • .-, T~ are all strings of the form x¢ m~ y¢ with x¢, y~ C ~* and m~ a special sym- bol not in ~(1 =< i = n). Each me serves as a marker to indicate the position of the scanning head on tape i; as in Davis' convention, the leftmost symbol of y~ is being scanned. DEFINITION 3. A successful computation by an n-tape machine with input string x = wv2 "'" , ve is a sequence D (°), D (1), D (2), ... , D (t) of instantaneous descriptions D (~) ....(q(~), T~ ~), , T~)(o(') < r =<t) such that (1) q(0) = q~ and for 2== i =< n, T~ °) = m;B. (2) T~ °) = mix = m~ ..., ~. (3) For allr, 0 -< r =< t-- 1, there is an integerb(r) such that if i # b(r) then T~ ~) = T~ ~+~). (4) For allr, 0 =<r =<t-- 1, ifq(~) = q~,S-- (z~,z2,...,z,~}where each ~; stands immediately to the right of m~ in T~ ~), and T~}~) = T~T2 " • • Tk--~mb(~)~kTk+~ "'" T,, then one of the following holds (a) (q~, S, Mb(,) , qj-} ~ 91Z, q(~+l) = q], and T(r+l)b(r) ~ T1T 2 *'' Tk_lTkfrgb(v)TIc+l "'" Tp.
Load more

Recommended publications
  • PDF with Red/Green Hyperlinks
    Elements of Programming Elements of Programming Alexander Stepanov Paul McJones (ab)c = a(bc) Semigroup Press Palo Alto • Mountain View Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and the publisher was aware of a trademark claim, the designations have been printed with initial capital letters or in all capitals. The authors and publisher have taken care in the preparation of this book, but make no expressed or implied warranty of any kind and assume no responsibility for errors or omissions. No liability is assumed for incidental or consequential damages in connection with or arising out of the use of the information or programs contained herein. Copyright c 2009 Pearson Education, Inc. Portions Copyright c 2019 Alexander Stepanov and Paul McJones All rights reserved. Printed in the United States of America. This publication is protected by copyright, and permission must be obtained from the publisher prior to any prohibited reproduction, storage in a retrieval system, or transmission in any form or by any means, electronic, mechanical, photocopying, recording, or likewise. For information regarding permissions, request forms and the appropriate contacts within the Pearson Education Global Rights & Permissions Department, please visit www.pearsoned.com/permissions/. ISBN-13: 978-0-578-22214-1 First printing, June 2019 Contents Preface to Authors' Edition ix Preface xi 1 Foundations 1 1.1 Categories of Ideas: Entity, Species,
    [Show full text]
  • Undecidability of the Word Problem for Groups: the Point of View of Rewriting Theory
    Universita` degli Studi Roma Tre Facolta` di Scienze M.F.N. Corso di Laurea in Matematica Tesi di Laurea in Matematica Undecidability of the word problem for groups: the point of view of rewriting theory Candidato Relatori Matteo Acclavio Prof. Y. Lafont ..................................... Prof. L. Tortora de falco ...................................... questa tesi ´estata redatta nell'ambito del Curriculum Binazionale di Laurea Magistrale in Logica, con il sostegno dell'Universit´aItalo-Francese (programma Vinci 2009) Anno Accademico 2011-2012 Ottobre 2012 Classificazione AMS: Parole chiave: \There once was a king, Sitting on the sofa, He said to his maid, Tell me a story, And the maid began: There once was a king, Sitting on the sofa, He said to his maid, Tell me a story, And the maid began: There once was a king, Sitting on the sofa, He said to his maid, Tell me a story, And the maid began: There once was a king, Sitting on the sofa, . " Italian nursery rhyme Even if you don't know this tale, it's easy to understand that this could continue indefinitely, but it doesn't have to. If now we want to know if the nar- ration will finish, this question is what is called an undecidable problem: we'll need to listen the tale until it will finish, but even if it will not, one can never say it won't stop since it could finish later. those things make some people loose sleep, but usually children, bored, fall asleep. More precisely a decision problem is given by a question regarding some data that admit a negative or positive answer, for example: \is the integer number n odd?" or \ does the story of the king on the sofa admit an happy ending?".
    [Show full text]
  • CS411-2015F-14 Counter Machines & Recursive Functions
    Automata Theory CS411-2015F-14 Counter Machines & Recursive Functions David Galles Department of Computer Science University of San Francisco 14-0: Counter Machines Give a Non-Deterministic Finite Automata a counter Increment the counter Decrement the counter Check to see if the counter is zero 14-1: Counter Machines A Counter Machine M = (K, Σ, ∆,s,F ) K is a set of states Σ is the input alphabet s ∈ K is the start state F ⊂ K are Final states ∆ ⊆ ((K × (Σ ∪ ǫ) ×{zero, ¬zero}) × (K × {−1, 0, +1})) Accept if you reach the end of the string, end in an accept state, and have an empty counter. 14-2: Counter Machines Give a Non-Deterministic Finite Automata a counter Increment the counter Decrement the counter Check to see if the counter is zero Do we have more power than a standard NFA? 14-3: Counter Machines Give a counter machine for the language anbn 14-4: Counter Machines Give a counter machine for the language anbn (a,zero,+1) (a,~zero,+1) (b,~zero,−1) (b,~zero,−1) 0 1 14-5: Counter Machines Give a 2-counter machine for the language anbncn Straightforward extension – examine (and change) two counters instead of one. 14-6: Counter Machines Give a 2-counter machine for the language anbncn (a,zero,zero,+1,0) (a,~zero,zero,+1,0) (b,~zero,~zero,-1,+1) (b,~zero,zero,−1,+1) 0 1 (c,zero,~zero,0,-1) 2 (c,zero,~zero,0,-1) 14-7: Counter Machines Our counter machines only accept if the counter is zero Does this give us any more power than a counter machine that accepts whenever the end of the string is reached in an accept state? That is, given
    [Show full text]
  • A Microcontroller Based Fan Speed Control Using PID Controller Theory
    A Microcontroller Based Fan Speed Control Using PID Controller Theory Thu Thu Zue Zin and Hlaing Thida Oo University of Computer Studies, Yangon thuthuzuezin @gmail.com Abstract PIC control application is widely used and User define popular in modern elections. The aim of this paper Microcontroller speed PIC 16F877 is design and construct the fan speed control system Duty cycle with microcontroller. PIC 16F877 and photo transistor is used for the system. User define speed can be selected by keypads for various speed. Motor is controlled by the pulse width modulation. Driver The system can be operate with normal mode and circuit timer mode. Delay time for timer mode is 10 seconds. The feedback signal from sensor is controlled by the proportional integral derivative equations to reproduce the desire duty cycle. Sensor Motor 1. Introduction Figure 1. Block Diagram of the System Motors are widely used in many applications, such as air conditioners , slide doors, washing machines and control areas. Motors are 2. Background Theory derivate it’s output performance due to the PID Controller tolerances, operating conditions, process error and Proportional Integral Derivative controller is measurement error. Pulse Width Modulation a generic control loop feedback mechanism widely control technique is better for control the DC motor used in industrial control systems. A PID controller than others techniques. PWM control the speed of attempts to correct the error between a measured motor without changing the voltage supply to process variable and a desired set point by calculating motor. Series of pulse define the speed of the and then outputting a corrective action that can adjust motor.
    [Show full text]
  • Copyright © 1998, by the Author(S). All Rights Reserved
    Copyright © 1998, by the author(s). All rights reserved. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission. WHATS DECIDABLE ABOUT HYBRID AUTOMATA by Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya Memorandum No. UCB/ERL M98/22 15 April 1998 WHAT'S DECIDABLE ABOUT HYBRID AUTOMATA by Thomas A. Henzinger,Peter W. Kopke, Anuj Puri, and Pravin Varaiya Memorandum No. UCB/ERL M98/22 15 April 1998 ELECTRONICS RESEARCH LABORATORY College ofEngineering University of California, Berkeley 94720 What's Decidable About Hybrid Automata?*^ Thomas A. Henzinger^ Peter W. Kopke^ Anuj Puri^ Pravin Varaiya^ Abstract. Hybrid automata model systems with both digital and analog compo nents, such as embedded control programs. Many verification tasks for such programs can be expressed as reachabibty problems for hybrid automata. By improving on pre vious decidability and undecidability results, we identify a precise boundary between decidability and undecidability for the reachabibty problem of hybrid automata. On the positive side, we give an (optimal) PSPACE reachabibty algorithmfor the case of initiabzed rectangular automata, where ab analog variables foUow independent tra jectories within piecewise-bnear envelopes and are reinitiabzed whenever the envelope changes. Our algorithm is based on the construction ofa timedautomaton that contains ab reachabibty information about a given initiabzed rectangular automaton.
    [Show full text]
  • Turing Machines [Fa’16]
    Models of Computation Lecture 6: Turing Machines [Fa’16] Think globally, act locally. — Attributed to Patrick Geddes (c.1915), among many others. We can only see a short distance ahead, but we can see plenty there that needs to be done. — Alan Turing, “Computing Machinery and Intelligence” (1950) Never worry about theory as long as the machinery does what it’s supposed to do. — Robert Anson Heinlein, Waldo & Magic, Inc. (1950) It is a sobering thought that when Mozart was my age, he had been dead for two years. — Tom Lehrer, introduction to “Alma”, That Was the Year That Was (1965) 6 Turing Machines In 1936, a few months before his 24th birthday, Alan Turing launched computer science as a modern intellectual discipline. In a single remarkable paper, Turing provided the following results: • A simple formal model of mechanical computation now known as Turing machines. • A description of a single universal machine that can be used to compute any function computable by any other Turing machine. • A proof that no Turing machine can solve the halting problem—Given the formal description of an arbitrary Turing machine M, does M halt or run forever? • A proof that no Turing machine can determine whether an arbitrary given proposition is provable from the axioms of first-order logic. This is Hilbert and Ackermann’s famous Entscheidungsproblem (“decision problem”). • Compelling arguments1 that his machines can execute arbitrary “calculation by finite means”. Although Turing did not know it at the time, he was not the first to prove that the Entschei- dungsproblem had no algorithmic solution.
    [Show full text]
  • Complexity: Automata DICE 2015
    An in-between “implicit” and “explicit” complexity: Automata DICE 2015 Clément Aubert Queen Mary University of London 12 April 2015 Introduction: Motivation (Dal Lago, 2011, p. 90) Question Is there an in-between? Answer One can also restrict the quality of the resources. ICC is machine-independent and without explicit bounds. 2 (Ibarra, 1971, p. 88) (Girard et al., 1992, p. 18) Machine-independant Bounded recursion on notation (Cobham, 1965), Bounded linear logic (Girard et al., 1992), Bounded arithmetic (Buss, 1986), . Explicit bounds Automaton, Descriptive complexity (Fagin, 1973), Auxiliary pushdown machine, Recursion on notation (Bellantoni and Cook, 1992), (Boolean circuit,) . Tiered recurrence (Leivant, 1993), . Implicit bounds Introduction: What is ICC? Machine-dependant Turing machine, Random access machine, Counter machine, . 3 (Ibarra, 1971, p. 88) (Girard et al., 1992, p. 18) Explicit bounds Automaton, Descriptive complexity (Fagin, 1973), Auxiliary pushdown machine, Recursion on notation (Bellantoni and Cook, 1992), (Boolean circuit,) . Tiered recurrence (Leivant, 1993), . Implicit bounds Introduction: What is ICC? Machine-dependant Machine-independant Turing machine, Bounded recursion on notation (Cobham, 1965), Random access machine, Bounded linear logic (Girard et al., 1992), Counter machine, . Bounded arithmetic (Buss, 1986), . 3 (Ibarra, 1971, p. 88) Explicit bounds Automaton, Descriptive complexity (Fagin, 1973), Auxiliary pushdown machine, Recursion on notation (Bellantoni and Cook, 1992), (Boolean circuit,) . Tiered recurrence (Leivant, 1993), . Implicit bounds Introduction: What is ICC? Machine-dependant Machine-independant Turing machine, Bounded recursion on notation (Cobham, 1965), Random access machine, Bounded linear logic (Girard et al., 1992), Counter machine, . Bounded arithmetic (Buss, 1986), . (Girard et al., 1992, p. 18) 3 (Ibarra, 1971, p. 88) (Girard et al., 1992, p.
    [Show full text]
  • Bounded Counter Languages
    Bounded Counter Languages⋆ Holger Petersen Reinsburgstr. 75 D-70197 Stuttgart Abstract. We show that deterministic finite automata equipped with k two-way heads are equivalent to deterministic machines with a single two-way input head and k − 1 linearly bounded counters if the accepted ∗ ∗ ∗ language is strictly bounded, i.e., a subset of a1a2 · · · am for a fixed se- quence of symbols a1,a2,...,am. Then we investigate linear speed-up for counter machines. Lower and upper time bounds for concrete recognition problems are shown, implying that in general linear speed-up does not hold for counter machines. For bounded languages we develop a technique for speeding up computations by any constant factor at the expense of adding a fixed number of counters. 1 Introduction The computational model investigated in the present work is the two-way counter machine as defined in [4]. Recently, the power of this model has been compared to quantum automata and probabilistic automata [17,14]. We will show that bounded counters and heads are equally powerful for finite deterministic devices, provided the languages under consideration are strictly bounded. By equally powerful we mean that up to a single head each two- way input head of a deterministic finite machine can be simulated by a counter bounded by the input length and vice versa. The condition that the input is bounded cannot be removed in general, since it is known that deterministic finite two-way two-head automata are more powerful than deterministic two- way one counter machines if the input is not bounded [2]. The special case of equivalence between deterministic one counter machines and two-head automata over a single letter alphabet has been shown with the help of a two-dimensional automata model as an intermediate step in [10], see also [11].
    [Show full text]
  • Programs = Data = First-Class Citizens in a Computational World
    PROGRAMS = DATA = FIRST-CLASS CITIZENS IN A COMPUTATIONAL WORLD Lars Hartmann Neil D. Jones Jakob Grue Simonsen + Visualization by Søren Bjerregaard Vrist (All now or recently at the University of Copenhagen) IMDEA and UCM Madrid (March 2012) Sources: I Conference CS2BIO Computer Science to Biology (ENTCS proceedings June 2010) I Journal Scientific Annals of Computer Science (2011, Vol. XXI) I Festschrift for Carolyn Talcott (November 2011, Springer Festschrift Series, LNCS vol. 7000) I Article accepted to appear in Philosophical Transactions A of the Royal Society | 0 | ALAN TURING STARTED THE BALL ROLLING (IN 1936) 1. A convincing analysis of the nature of computation 2. A very early model of computation (MOC) 3. The first programmers' manual 4. Undecidability of the halting problem 5. Universal Turing machine (a self-interpreter) 6. Contributor to the “Confluence of ideas'": that all sensible models of computation are equivalent, e.g., I Turing machine I Lambda calculus I Recursive function definitions I String rewrite systems | 1 | 75 YEARS OF MODELS OF COMPUTATION (just a few) Lambda calculus Church 1936 Turing machine 1936 von Neumann architecture 1945 Finite automata Rabin and Scott Counter machine Lambek and Minsky Random access machine (RAM) Cook and Reckhow Random access stored program (RASP) Elgot and Robinson Cellular automaton, LIFE,.. von Neumann, Conway, Wolfram Abstract state machine Gurevich et al Text register machine Moss Blob model 2010 | 2 | ABOUT MOCS (MODELS OF COMPUTATION) Criteria I How to compare I How to improve I Lacks, failings, inconveniences I What are they suitable for? Programming? Theorem proving ? Modeling ? . New direction: biological computing I Enormous potential (price, concurrency, automation, .
    [Show full text]
  • Complexity of Small Universal Turing Machines: a Survey
    The complexity of small universal Turing machines: a survey⋆ Turlough Neary1 and Damien Woods2 1 School of Computer Science & Informatics, University College Dublin, Ireland. [email protected] 2 Division of Engineering & Applied Science, California Institute of Technology, Pasadena, CA 91125, USA. [email protected] Abstract. We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient (polynomial time) simula- tors of Turing machines. These are some of the most intuitively simple computational devices and previously the best known simulations were exponentially slow. We discuss recent work that shows that these ma- chines are indeed efficient simulators. In addition, another related result shows that Rule 110, a well-known elementary cellular automaton, is ef- ficiently universal. We also discuss some old and new universal program size results, including the smallest known universal Turing machines. We finish the survey with results on generalised and restricted Turing machine models including machines with a periodic background on the tape (instead of a blank symbol), multiple tapes, multiple dimensions, and machines that never write to their tape. We then discuss some ideas for future work. 1 Introduction In this survey we explore results related to the time and program size complexity of universal Turing machines, and other models of computation. We also discuss arXiv:1110.2230v1 [cs.CC] 10 Oct 2011 results for variants on the Turing machine model to give an idea of the many strands of work in the area.
    [Show full text]
  • Remote Exploitation of an Unaltered Passenger Vehicle
    TECHNICAL WHITE PAPER Remote Exploitation of an Unaltered Passenger Vehicle Chris Valasek, Director of Vehicle Security Research for IOActive [email protected] Charlie Miller, Security Researcher for Twitter [email protected] Copyright ©2015. All Rights Reserved.- 1 - Contents Introduction ............................................................................................................................ 5 Target – 2014 Jeep Cherokee ............................................................................................... 7 Network Architecture .......................................................................................................... 8 Cyber Physical Features .................................................................................................. 10 Adaptive Cruise Control (ACC) ..................................................................................... 10 Forward Collision Warning Plus (FCW+) ...................................................................... 10 Lane Departure Warning (LDW+) ................................................................................. 11 Park Assist System (PAM) ............................................................................................ 12 Remote Attack Surface ..................................................................................................... 13 Passive Anti-Theft System (PATS) ............................................................................... 13 Tire Pressure Monitoring System (TPMS) ...................................................................
    [Show full text]
  • List of Glossary Terms
    List of Glossary Terms A Ageofaclusterorfuzzyrule 1054 A correlated equilibrium 3064 Agent 58, 76, 105, 1767, 2578, 3004 Amechanism 1837 Agent architecture 105 Anearestneighbor 790 Agent based models 2940 A social choice function 1837 Agent (or software agent) 2999 A stochastic game 3064 Agent-based computational models 2898 Astrategy 3064 Agent-based model 58 Abelian group 2780 Agent-based modeling 1767 Absolute temperature 940 Agent-based modeling (ABM) 39 Absorbing state 1080 Agent-based simulation 18, 88 Abstract game 675 Aggregation 862 Abstract game of network formation with respect to Aggregation operators 122 irreflexive dominance 2044 Aging 2564, 2611 Abstract game of network formation with respect to path Algebra 2925 dominance 2044 Algebraic models 2898 Accuracy 161, 827 Algorithm 2496 Accuracy (rate) 862 Algorithmic complexity of object x 132 Achievable mate 3235 Algorithmic self-assembly of DNA tiles 1894 Action profile 3023 Allowable set of partners 3234 Action set 3023 Almost equicontinuous CA 914, 3212 Action type 2656 Alphabet of a cellular automaton 1 Activation function 813 ˛-Level set and support 1240 Activator 622 Alternating independent-2-paths 2953 Active membranes 1851 Alternating k-stars 2953 Actors 2029 Alternating k-triangles 2953 Adaptation 39 Amorphous computer 147 Adaptive system 1619 Analog 3187 Additive cellular automata 1 Analog circuit 3260 Additively separable preferences 3235 Ancilla qubits 2478 Adiabatic switching 1998 Anisotropic elements 754 Adjacency matrix 1746, 3114 Annealed law 2564 Adjacent 2864,
    [Show full text]