Reversibility of Turing Machine Computations
|
|
- Mervyn Bell
- 5 years ago
- Views:
Transcription
1 Reversiility of Turing Machine Coputations Zvi M. Kede NYU CS Technical Report TR May 13, 2013 Astract Since Bennett s 1973 seinal paper, there has een a growing interest in general-purpose, reversile coputations and they have een studied using oth atheatical and physical odels. Following Bennett, given a terinating coputation of a deterinistic Turing Machine, one ay e interested in constructing a new Turing Machine, whose coputation consists of two stages. The first stage eulates the original Turing Machine coputation on its working tape, while also producing the trace of the coputation on a new history tape. The second stage reverses the first stage using the trace inforation. Ideally, one would want the second stage to traverse whole-achine states in the reverse order fro that traversed in the first stage. But this is ipossile other than for trivial coputations. Bennett constructs the second phase y using additional controller states, eyond those used during the first stage. In this report, a construction of the new achine is presented in which the second stage uses the sae and only those controller states that the first stage used and they are traversed in the reverse order. The sole eleent that is not fully reversed is the position of the head on the history tape, where it is out of phase y one square copared to the first stage. 1 Introduction In 1973, Bennett produced a seinal paper [1] in the field of reversile coputations. Inforally stated, Bennett s goal is to construct a achine perforing the sae coputation as the original achine and then undoing it, while preserving a copy of the useful output of the coputation. In this report, the preservation of the output will not e considered, as the focus is on reversiility only. A terinating coputation of a deterinistic Turing Machine can e descried y a sequence of whole-achine states, etween the sequential steps of the coputation, in the for of One ay want to extend the coputation to otain s 1 ; s 2 ; ; s f 2 ; s f 1 ; s f (1) s 1 ; s 2 ; ; s f 2 ; s f 1 ; s f ; s f C1 ; s f C2 ; ; s F 1 ; s F ; (2) which consists of (1) and its reverse, in the sense that F D 2f 1 and s 1Ci D s F i, for i D 0; 1; ; f 2, so that (2) is s 1 ; s 2 ; ; s f 2 ; s f 1 ; s f ; s f 1 ; s f 2 ; ; s 2 ; s 1 (3) However, as the coputation is deterinistic, this is only possile if s f 2 D s f, iplying f D 1 or f D 2. That is, either the syste is stationary, or it alternates etween two states. But it ay e possile to reverse the arrow of tie and in this way reverse the coputation, just as in a classical echanical syste. New York University, zvi.kede@nyu.edu 1
2 2 Bennett s Construction It is assued that the reader is copletely failiar with [1], ut as needed various points of that paper will e riefly suarized in this section. Bennett starts with a 1-tape Turing Machine whose controller s operation is defined y quintuples of the for T! T 0 ; (4) where is the old state, the new state, T is a syol to e read on the tape, T 0 is the syol to e written, and is one of, 0, and C, respectively indicating left, null, and right shift. Bennett first odifies the original 1-tape achine y replacing a quintuple with a pair of quadruples. Consider a generic quintuple, one that does not deal with the initial or the final state. So let the quintuple in (4) e the th quintuple in soe ordering of the quintuples. It is replaced y a pair of quadruples T! T 0 A 0 (5) A 0 =! ; where A 0 is an additional state, and the first quadruple instructs the head to overwrite T with T 0 and not to shift, and the second quadruple instructs the head to only shift as specified y and not to write. Let the achine e M. Then, Bennett constructs a new achine M 0, which has three tapes, working, history, and output, and which operates in three stages. In stage 1, M 0 ehaves just like M and perfors the coputation using the working tape while also writing a trace of the coputation on the history tape. In stage 2, M 0 copies the working tape, which now contains the output of the coputation, onto the output tape. In Stage 3, M 0 restores the working tape and the history tape. The quadruples defining M 0 are listed in Tale 1 of [1]. Consider a trivial odification of M 0, still to e called M 0, that is just a restriction of Bennett s construction to two tapes and reversiility (without copying the output onto the third tape). The quadruples of M 0 are listed in Tale 1. The two syols in rackets refer to the two tapes. The achine will proceed in two stages 1. In stage 1, the copute stage, M 0 executes the coputation as M did using the working tape, while writing a trace of the coputation on the history tape. This stage corresponds to Bennett s first stage. 2. In stage 2, the restore stage, M 0 uses the inforation on the history tape to restore the original values to the working tape, while erasing (and thus restoring to the original lank values) the history tape. This stage corresponds to Bennett s third stage. To enale the coputing and the restoring, the two quadruples of (5) are replaced y four quadruples 1. For stage 1 2. For stage Exaple Œ T =! Œ T 0 C A 0 A 0 Œ =! Œ C k Œ =! Œ C 0 C 0 Œ T 0 =! Œ C j Here and susequently, when a reference to the quintuples laeled with is ade, it is assued that 2 < < N 1, so that a generic pair of instructions can e discussed. Consider an exaple of a sall part of the coputation. Let, then, M contain quadruples T! T 0 A 0 A 0 =! Note the choice of as the left shift in this exaple. Then, in M 0, there will e quadruples 2
3 Tale 1 Tale 1 of [1] restricted to two tapes and slightly reforatted. Note also that in the N th pair of quadruples in the Copute Stage, A f is replaced y C f. Contents of tape Working History Stage Quadruples tape tape Copute Retrace 1/ / N / N / / 1/ A 1 Œ =! Œ C A 0 1 A 0 1 Œ =! Œ C 1 A 2 Œ T =! Œ T 0 C A 0 A 0 Œ =! Œ Af 1 Œ =! Œ C A 0 N A 0 N Œ =! Œ 0 N C f C f Œ = N! Œ 0 CN 0 CN 0 Œ =! Œ C f 1 C k Œ =! Œ C 0 C 0 Œ T 0 =! Œ C j C 2 Œ = 1! Œ C1 0 C1 0 Œ =! Œ C 1 INPUT OUTPUT INPUT HISTORY 1. For stage 1 2. For stage 2 Œ T =! Œ T 0 C A 0 A 0 Œ =! Œ C k Œ =! Œ C C 0 C 0 Œ T 0 =! Œ C j In Fig. 1, there are three consecutive states of the coputation fro stage 1 and the corresponding three consecutive states fro stage 2. Only the relevant squares, two in nuer, are depicted for each of the two tapes. Looking at the upper part of the figure, illustrating a fragent of stage 1 the controller is in state ; H 1, the head assigned to the working tape, is on a square containing syol T ; and H 2, the head assigned to the history tape, is on a square whose contents is not specified, though it is known that this is the last square written on the history tape, and the square to the right of it contains a lank,. Then, see the evolution during two steps is shown. Note that H 1 shifted one square to the left, as instructed y a quadruple, and the square iediately to the right of H 2, and not indicated on the figure, contains a. Looking at the lower part of the figure, illustrating the corresponding fragent of stage 2, all the squares to the right of H 2 have een restored to the original values of and the achine will now undo a fragent of the coputation 3
4 Quadruples Working tape History tape T A [ T /] [ ] j [/ ] [ ] A k C [/ ] [ ] C k C k C k C [ /] [ ] C j C T C C j C j Figure 1 A fragent of stage 1 and the corresponding fragent of stage 2 for M 0. just descried aove. The controller is in state C k. H 1 is on a square whose contents is unspecified, and to its right is a square with T 0, which needs to e replaced y T. The inforation to do that is in the square on which H 2 is. The first quadruple instructs H 1 to shift to the right and H 2 to write a. The second quadruple instructs H 1 to overwrite T 0 with T and instructs H 2 to shift to the left. 3 Bennett s Construction Modified So far, Bennett s construction was descried. Now, y uilding on Bennett s construction, it will e shown that it is possile to tie-reverse a Turing Machine coputation so that there are no new states in stage 2, and the traversal of states in stage 2 is the reversal of their traversal in stage 1. Before descriing the odified construction, it is useful reviewing Bennett s reason for the replaceent of quintuple (4) y a pair of quadruples (5). The sequence of operations in a quintuple during a single step involves in general two squares 1. Read the syol on the current square. 2. Write a syol on that square. 4
5 Tale 2 Tale 1 odified, with quadruples replaced y quintuples. Letter x stands for any syol that could e on a tape, so that any quintuple with x stands for a faily of quintuples, one for each possile value of x on the tape. Note for future reference that H 2 does not shift in instructions N of stage 1 ut shifts to the left in instructions N of stage 2. Contents of tape Working History Stage Quintuples tape tape Copute 1/ A 1 Œ! Œ 0 0 A 0 1 A 0 1 Œ! Œ C 1 C A 2 INPUT / Œ T! Œ T A 0 A 0 Œ T 0! Œ T 0 C Retrace N / N / Af 1 Œ! Œ 0 0 A 0 N A 0 N Œ! Œ 0 N 0 A f A f Œ N! Œ 0 A 0 N A 0 N Œ x! Œ 0 x 0 A f 1 OUTPUT HISTORY / Œ x! Œ x A 0 A 0 Œ T 0 x! Œ T 0 x 0 1/ A 2 Œ x 1! Œ x A 0 1 A 0 1 Œ! Œ 0 0 A 1 INPUT 3. Shift. As stated in [1], the reversal of these actions is 1. Shift. 2. Read a syol on the current square. 3. Write a syol on that square. But this is not allowed under the original definition of quintuples. Bennett thus decoposes the quintuple into two quadruples. The first perfors 1. Read the syol on the current square. 2. Write a syol on that square. The second perfors 1. Shift. During stage 1, H 1, on the working tape, in general, changes the direction of its shifts ultiple ties. During stage 2, these shifts need to e reversed, and a shift occurs efore a syol can e read and overwritten ased on the specifications of the original quintuple. 5
6 Note, that in contrast, the oveents of H 2 on the history tape follow the sae pattern for every achine. Looking at Tale 1, note that during stage 1, H 2 shifts only to the right, and during stage 2, it shifts only to the left. Therefore, the ehavior of H 2 can e specified using the original-for quintuples. This provides significant advantage the direction of the shift can depend not only on the state of the controller, ut also on the syol read y H 2. This akes it natural to produce a specification of the achine so that it ehaves differently depending on the stage the achine is in. Tale 1 is odified to otain Tale 2. This odification of M 0 will e called M 00. In its definition, quadruples are replaced y quintuples of the for (using Bennett s notation) A Œ ˇ! Œ ı A ; which eans if the achine is in state A, H 1 reads ˇ, and H 2 reads, then H 1 writes ı and shifts y, and H 2 writes and shifts y, and the new state is A. Exaining Tale 2, note that the quintuples do not add anything new to the ehavior of H 1. They are just the quadruples of Tale 1 written ore cuersoely. However, the situation is quite different with H 2. Looking at the two quintuples of in stage 1, H 2 does nothing in the first quintuple and oth writes and shifts in the second quintuple. In stage 2, it oth writes and shifts in the first quintuple an does nothing in the second quintuple. The key oservation is, that as a consequence of the construction, in stage 1, H 2 reads a lank,, and in stage 2, it reads a non-lank,. Therefore the ehaviors of the achines, including the direction of shifts, are different in the two stages, even though the controller states are the sae in stage 2 as in stage Exaple Consider now an exaple, analogous to Exaple 2.1. So again M contains quadruples Then, in M 00, there will e quintuples 1. For stage 1 2. For stage 2 T! T 0 A 0 A 0 =! Œ T! Œ T A 0 A 0 Œ T 0! Œ T 0 C Œ x! Œ x C A 0 A 0 Œ T 0 x! Œ T 0 x 0 In Fig. 2, there are three consecutive states of the coputation, fro stage 1 and the corresponding three consecutive states fro stage 2. Only the relevant squares, three in nuer, are depicted for each of the two tapes. Looking at the upper part of the figure, illustrating a fragent of stage 1, the controller is in state, H 1 is on a square containing syol T, and H 2 is on a square whose contents is a lank,. Contrast this with Exaple 2.1, in which it was known that H 2 was on a square not containing. Then, oserve the evolution during two steps. Note that H 1 shifted one square to the left, as instructed y a quintuple, and the square under H 2, which is not indicated in the figure, contains a. Looking at the lower part of the figure, illustrating the corresponding fragent of stage 2, all the squares to the right of H 2 have een restored to the original values of and the achine will now undo a fragent of the coputation just descried aove. The controller is in state. H 1 is on a square whose contents is unspecified, and to its the right is a square with T 0, which needs to e replaced y T. The inforation to do that is in the square on which H 2 is. The first quintuple instructs H 1 to shift to the right and for H 2 to write a and to shift to the left. The second quintuple instructs H 1 to overwrite T 0 with T and instructs H 2 not to do anything. 6
7 Working tape HistoryQuintuples tape T A [ T ] [ 0 0] j [ ] [ ] A k A [ x ] [ x ] k [ x] [ T 0 x 0] A j T Figure 2 A fragent of stage 1 and the corresponding fragent of stage 2 for M Discussion As stated in Section 1 it is ipossile to otain a coputation of the for (3). However, it is possile to otain soething of very close for to it. A whole-achine state (cf. [1]) is the state of the controller, the contents of the tapes, and the positions of the heads on the tapes. For a 2-tape Turing Machine, this could e a quintuple of the for where 1. is the state of the controller. s D. ; ˇ1; ˇ2; 1 ; 2 /; 2. ˇ1 (respectively ˇ2) is the description of tape 1 (respectively tape 2). This will e a inial finite sequence of squares on the tape that includes all the non-lank squares. Note that as the origin of a tape is not specified as part of the definition of a Turing Machine (a tape is hoogeneous), it is not eaningful to specify the asolute position of the sequence of squares on the tape (respectively 2 ) is the position of the H 1 (respectively H 2 ) with respect to the leftost square of ˇ1 (respectively ˇ2). If ˇ1 (respectively ˇ2) is epty, then 1 (respectively 2 ) is not eaningful and is set to 0. 7
8 Figure 3 Whole-achine configurations corresponding to Fig. 2. Only tape 2 is shown. Epty squares denote lank squares and shaded squares denote non-lank squares. Squares that are not shown to the left and to the right of the shown squares all contain lanks. The squares indicated y ellipses are shaded and do not contains lanks. The square shaded fro lower left to upper right corners contains. Syols in other shaded squares are not specified. In Fig. 3, the values of, ˇ2, and 2, corresponding to Fig. 2 are shown scheatically. Let the top achine state in the upper part of the figure take place in step t 1 and the otto achine state in the lower part of the figure take place in step t 2. Then oserve that for i D 0, 1, or t1 Ci D t2 i, 2. ˇ2t 1 Ci D ˇ2t 2 i, 3. 2 t 1 Ci D 2 t 2 i 3. Note that the positions of H 2 are not the sae for the corresponding whole-achine states. The reason for the out of synchronization of H 2 is the difference etween instructions corresponding to N in stage 1 and stage 2 of Tale 2. In stage 1 during the two instructions in N, H 2 does not ove, and in stage 2 it oves one square to the left. Thus, during stage 2, it will e ahead of the other eleents of the whole-achine state. Note that after M 00 reaches the end of stage 2, H 2 is one square to the left of the square it was on at the eginning of stage 1. But as tape 2 is epty and there is no origin, in oth cases 2 D 0. 8
9 Reference [1] Bennett, C. H. Logical reversiility of coputation. IBM Journal of Research and Developent 17, (1973). 9
dt dt THE AIR TRACK (II)
THE AIR TRACK (II) References: [] The Air Track (I) - First Year Physics Laoratory Manual (PHY38Y and PHYY) [] Berkeley Physics Laoratory, nd edition, McGraw-Hill Book Copany [3] E. Hecht: Physics: Calculus,
More informationLecture 8.2 Fluids For a long time now we have been talking about classical mechanics, part of physics which studies macroscopic motion of
Lecture 8 luids or a long tie now we have een talking aout classical echanics part of physics which studies acroscopic otion of particle-like ojects or rigid odies Using different ethods we have considered
More informationEquational Security Proofs of Oblivious Transfer Protocols
Equational Security Proofs of Olivious Transfer Protocols Baiyu Li Daniele Micciancio January 9, 2018 Astract We exeplify and evaluate the use of the equational fraework of Micciancio and Tessaro (ITCS
More informationNuclear Instruments and Methods in Physics Research B 262 (2007)
Nuclear Instruents and Methods in Physics Research B 262 (27) 33 322 NIM B Bea Interactions with Materials & Atos www.elsevier.co/locate/ni Peak shape ethods for general order theroluinescence glow-peaks:
More informationHandout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1.
Notes on Coplexity Theory Last updated: October, 2005 Jonathan Katz Handout 7 1 More on Randoized Coplexity Classes Reinder: so far we have seen RP,coRP, and BPP. We introduce two ore tie-bounded randoized
More informationA Dynamic Theory of Strategic Decision Making applied to the Prisoner s Dilemma
Dynaic Theory of Strategic Decision Making applied to the Prisoner s Dilea Gerald H Thoas and Keelan Kane Milwaukee School of Engineering dapt of Illinois Introduction The classic prisoner s dilea (PD)
More informationMotion Analysis of Euler s Disk
Motion Analysis of Euler s Disk Katsuhiko Yaada Osaka University) Euler s Disk is a nae of a scientific toy and its otion is the sae as a spinning coin. In this study, a siple atheatical odel is proposed
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationI-Hsiang Wang Principles of Communications Lecture 02
Lecture 02: Digital Modulation Outline Digital-to-analog and analog-to-digital: a signal space perspective Pulse aplitude odulation (PAM), pulse shaping, and the Nyquist criterion Quadrature aplitude odulation
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationSelfish Traffic Allocation for Server Farms
Selfish Traffic Allocation for Server Fars Artur Czua Departent of Coputer Science New Jersey Institute of Technology czua@cis.nit.edu Piotr Krysta Max-Planck-Institut für Inforatik Saarrücken, Gerany
More information1 Identical Parallel Machines
FB3: Matheatik/Inforatik Dr. Syaantak Das Winter 2017/18 Optiizing under Uncertainty Lecture Notes 3: Scheduling to Miniize Makespan In any standard scheduling proble, we are given a set of jobs J = {j
More informationForced Mechanical Oscillations
9 Carl von Ossietzky University Oldenurg Faculty V - Institute of Physics Module Introductory Laoratory Course Physics Part I Forced Mechanical Oscillations Keywords: HOOKE's law, haronic oscillation,
More informationChapter 2: Introduction to Damping in Free and Forced Vibrations
Chapter 2: Introduction to Daping in Free and Forced Vibrations This chapter ainly deals with the effect of daping in two conditions like free and forced excitation of echanical systes. Daping plays an
More informationSimple procedures for finding mean first passage times in Markov chains
Res. Lett. Inf. Math. Sci., 2005, Vol. 8, pp 209-226 209 Availale online at http://iis.assey.ac.nz/research/letters/ Siple procedures for finding ean first passage ties in Markov chains JEFFREY J. HUNER
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More information1 Proof of learning bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a
More informationReduced Length Checking Sequences
Reduced Length Checing Sequences Robert M. Hierons 1 and Hasan Ural 2 1 Departent of Inforation Systes and Coputing, Brunel University, Middlesex, UB8 3PH, United Kingdo 2 School of Inforation echnology
More informationNow multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get:
Equal Area Criterion.0 Developent of equal area criterion As in previous notes, all powers are in per-unit. I want to show you the equal area criterion a little differently than the book does it. Let s
More informationOcean 420 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers
Ocean 40 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers 1. Hydrostatic Balance a) Set all of the levels on one of the coluns to the lowest possible density.
More informationEQUIVALENT CIRCUIT MODEL OF SEMICONDUCTOR LASERS TAKING ACCOUNT OF GAIN SUPPRESSION
EQUIVALENT CIRCUIT MODEL OF SEMICONDUCTOR LASERS TAKING ACCOUNT OF GAIN SUPPRESSION Kaiz Aedi and Mohsen Khanzadeh Departent of Electrical Engineering, Faculty of Electrical and Coputer Engineering, Shahid
More informationAn Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control
An Extension to the Tactical Planning Model for a Job Shop: Continuous-Tie Control Chee Chong. Teo, Rohit Bhatnagar, and Stephen C. Graves Singapore-MIT Alliance, Nanyang Technological Univ., and Massachusetts
More information8.1 Force Laws Hooke s Law
8.1 Force Laws There are forces that don't change appreciably fro one instant to another, which we refer to as constant in tie, and forces that don't change appreciably fro one point to another, which
More informationSome Perspective. Forces and Newton s Laws
Soe Perspective The language of Kineatics provides us with an efficient ethod for describing the otion of aterial objects, and we ll continue to ake refineents to it as we introduce additional types of
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationMath Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65
The Monotone Lindelöf Property and Separability in Ordered Spaces by H. Bennett, Texas Tech University, Lubbock, TX 79409 D. Lutzer, College of Willia and Mary, Williasburg, VA 23187-8795 M. Matveev, Irvine,
More informationI-Hsiang Wang Principle of Communications Lecture 02
Lecture 02: Digital Modulation Outline Digital-to-analog and analog-to-digital: a signal space perspective Pulse aplitude odulation (PAM), pulse shaping, and the Nyquist criterion Quadrature aplitude odulation
More informationApproximation in Stochastic Scheduling: The Power of LP-Based Priority Policies
Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing
More informationCONTROL SYSTEMS, ROBOTICS AND AUTOMATION Vol. XV - Modeling of Discrete Event Systems - Stéphane Lafortune
CONTROL SYSTEMS, ROBOTICS AND AUTOMATION Vol. XV - Modeling of Discrete Event Systes - Stéphane Lafortune MODELING OF DISCRETE EVENT SYSTEMS Stéphane Lafortune The University of Michigan, USA Keywords:
More informationU V. r In Uniform Field the Potential Difference is V Ed
SPHI/W nit 7.8 Electric Potential Page of 5 Notes Physics Tool box Electric Potential Energy the electric potential energy stored in a syste k of two charges and is E r k Coulobs Constant is N C 9 9. E
More informationBALLISTIC PENDULUM. EXPERIMENT: Measuring the Projectile Speed Consider a steel ball of mass
BALLISTIC PENDULUM INTRODUCTION: In this experient you will use the principles of conservation of oentu and energy to deterine the speed of a horizontally projected ball and use this speed to predict the
More informationAnalyzing Simulation Results
Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More information1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More informationMSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE
Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL
More informationAbout the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry
About the definition of paraeters and regies of active two-port networks with variable loads on the basis of projective geoetry PENN ALEXANDR nstitute of Electronic Engineering and Nanotechnologies "D
More informationOn weighted averages of double sequences
nnales Matheaticae et Inforaticae 39 0) pp. 7 8 Proceedings of the Conference on Stochastic Models and their pplications Faculty of Inforatics, University of Derecen, Derecen, Hungary, ugust 4, 0 On weighted
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informationNote-A-Rific: Mechanical
Note-A-Rific: Mechanical Kinetic You ve probably heard of inetic energy in previous courses using the following definition and forula Any object that is oving has inetic energy. E ½ v 2 E inetic energy
More informationTHE ROCKET EXPERIMENT 1. «Homogenous» gravitational field
THE OCKET EXPEIENT. «Hoogenous» gravitational field Let s assue, fig., that we have a body of ass Μ and radius. fig. As it is known, the gravitational field of ass Μ (both in ters of geoetry and dynaics)
More informationReading from Young & Freedman: For this topic, read the introduction to chapter 25 and sections 25.1 to 25.3 & 25.6.
PHY10 Electricity Topic 6 (Lectures 9 & 10) Electric Current and Resistance n this topic, we will cover: 1) Current in a conductor ) Resistivity 3) Resistance 4) Oh s Law 5) The Drude Model of conduction
More informationma x = -bv x + F rod.
Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationThe accelerated expansion of the universe is explained by quantum field theory.
The accelerated expansion of the universe is explained by quantu field theory. Abstract. Forulas describing interactions, in fact, use the liiting speed of inforation transfer, and not the speed of light.
More informationDefect-Aware SOC Test Scheduling
Defect-Aware SOC Test Scheduling Erik Larsson +, Julien Pouget*, and Zebo Peng + Ebedded Systes Laboratory + LIRMM* Departent of Coputer Science Montpellier 2 University Linköpings universitet CNRS Sweden
More informationChaos and Dynamical Systems
Chaos and Dynamical Systems y Megan Richards Astract: In this paper, we will discuss the notion of chaos. We will start y introducing certain mathematical concepts needed in the understanding of chaos,
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationExponent Laws Unit 4 Exponential Functions - Lesson 18
(A) Lesson Contet BIG PICTURE of this UNIT: CONTEXT of this LESSON: What are & how & why do we use eponential and logarithic functions? proficiency with algeraic anipulations/calculations pertinent to
More informationPh 20.3 Numerical Solution of Ordinary Differential Equations
Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing
More informationTheory for dynamic longitudinal dispersion in fractures and rivers with Poiseuille flow
GEOPHYSICAL RESEARCH LETTERS, VOL. 39,, doi:10.1029/2011gl050831, 2012 Theory for dynaic longitudinal dispersion in fractures and rivers with Poiseuille flow Lichun Wang, 1 M. Bayani Cardenas, 1 Wen Deng,
More informationGeneralized NEQ for assessment of ultrasound image quality
Generalized NEQ for assessent of ultrasound iage quality Roger J. Zep *, Craig K. Aey, and Michael F. Insana Departent of Bioedical Engineering, University of California, Davis, 9566 ABSTRACT An inforation-theoretic
More informationEquilibria on the Day-Ahead Electricity Market
Equilibria on the Day-Ahead Electricity Market Margarida Carvalho INESC Porto, Portugal Faculdade de Ciências, Universidade do Porto, Portugal argarida.carvalho@dcc.fc.up.pt João Pedro Pedroso INESC Porto,
More informationUNIT HOMEWORK MOMENTUM ANSWER KEY
UNIT HOMEWORK MOMENTUM ANSWER KEY MOMENTUM FORMULA & STUFF FROM THE PAST: p = v, TKE = ½v 2, d = v t 1. An ostrich with a ass of 146 kg is running to the right with a velocity of 17 /s. a. Calculate the
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More informationA := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.
59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far
More informationCharacterizations of the (h, k, µ, ν) Trichotomy for Linear Time-Varying Systems
Characterizations of the h, k, µ, ν) Trichotoy for Linear Tie-Varying Systes arxiv:1512.01714v1 [ath.ds] 6 Dec 2015 Ioan-Lucian Popa, Traian Ceauşu, Mihail Megan Astract The present paper considers a concept
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationLost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies
OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationMINIMUM DISTANCE DECODING OF GENERAL ALGEBRAIC GEOMETRY CODES VIA LISTS
MINIMUM DISTANCE DECODING OF GENERAL ALGEBRAIC GEOMETRY CODES VIA LISTS NATHAN DRAKE AND GRETCHEN L MATTHEWS DEPARTMENT OF MATHEMATICAL SCIENCES CLEMSON UNIVERSITY CLEMSON, SC 9634-0975 USA E-MAIL: GMATTHE@CLEMSONEDU
More informationbefore the collision and v 1 f and v 2 f after the collision. Since conservation of the linear momentum
Lecture 7 Collisions Durin the preious lecture we stared our discussion of collisions As it was stated last tie a collision is an isolated eent in which two or ore odies (the collidin odies) exert relatiely
More informationMotion of Charges in Uniform E
Motion of Charges in Unifor E and Fields Assue an ionized gas is acted upon by a unifor (but possibly tie-dependent) electric field E, and a unifor, steady agnetic field. These fields are assued to be
More informationDSPACE(n)? = NSPACE(n): A Degree Theoretic Characterization
DSPACE(n)? = NSPACE(n): A Degree Theoretic Characterization Manindra Agrawal Departent of Coputer Science and Engineering Indian Institute of Technology, Kanpur 208016, INDIA eail: anindra@iitk.ernet.in
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationOn Process Complexity
On Process Coplexity Ada R. Day School of Matheatics, Statistics and Coputer Science, Victoria University of Wellington, PO Box 600, Wellington 6140, New Zealand, Eail: ada.day@cs.vuw.ac.nz Abstract Process
More informationChapter 1: Basics of Vibrations for Simple Mechanical Systems
Chapter 1: Basics of Vibrations for Siple Mechanical Systes Introduction: The fundaentals of Sound and Vibrations are part of the broader field of echanics, with strong connections to classical echanics,
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationA sensitivity analysis algorithm for hierarchical decision models
European Journal of Operational Research 85 (28) 266 288 Decision Support A sensitivity analysis algorith for hierarchical decision odels Hongyi hen *, Dundar F. Kocaoglu Departent of Engineering and Technology
More informationLevel Crossing Rate in Terms of the Characteristic Function: A New Approach for Calculating the Fading Rate in Diversity Systems
Level Crossing Rate in ers of e Characteristic Function: A New Approach for Calculating e Fading Rate in Diversity Systes Ali Adi Meer IEEE and Mostafa Kaveh Fellow IEEE Dept. of Elec. and Cop. Eng. New
More informationData-Driven Imaging in Anisotropic Media
18 th World Conference on Non destructive Testing, 16- April 1, Durban, South Africa Data-Driven Iaging in Anisotropic Media Arno VOLKER 1 and Alan HUNTER 1 TNO Stieltjesweg 1, 6 AD, Delft, The Netherlands
More informationHomework 3 Solutions CSE 101 Summer 2017
Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing
More informationGeneralized Queries on Probabilistic Context-Free Grammars
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 1, JANUARY 1998 1 Generalized Queries on Probabilistic Context-Free Graars David V. Pynadath and Michael P. Wellan Abstract
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More informationMomentum, p. Crash! Collisions (L8) Momentum is conserved. Football provides many collision examples to think about!
Collisions (L8) Crash! collisions can be ery coplicated two objects bang into each other and exert strong forces oer short tie interals fortunately, een though we usually do not know the details of the
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More informationKinematics and dynamics, a computational approach
Kineatics and dynaics, a coputational approach We begin the discussion of nuerical approaches to echanics with the definition for the velocity r r ( t t) r ( t) v( t) li li or r( t t) r( t) v( t) t for
More informationXV International PhD Workshop OWD 2013, October Limitations Caused by Sampling and Quantization in Position Control of a Single Axis Robot
XV International PhD Workshop OWD 2013, 19 22 Octoer 2013 Liitations Caused y Sapling and Quantization in Position Control of a Single Axis Root Csaa Budai, Budapest University of Technology and Econoics
More informationEmbedded Systems Development
bedded Systes Developent Lecture 4 sterel Daniel Kästner AbsInt Angewandte Inforati GbH aestner@absint.co 2 Valued Signals vs. Variables Data expressions: references to constants or variables?s yields
More informationMomentum, p = m v. Collisions and Work(L8) Crash! Momentum and Collisions. Conservation of Momentum. elastic collisions
Collisions and Work(L8) Crash! collisions can be ery coplicated two objects bang into each other and exert strong forces oer short tie interals fortunately, een though we usually do not know the details
More informationAsymptotically Tight Bounds for Performing. BMMC Permutations on Parallel Disk Systems. (Extended Abstract) Thomas H. Cormen. Leonard F.
Asyptotically Tight Bounds for Perforing BMMC Perutations on Parallel Disk Systes (Extended Astract) Thoas H. Coren Leonard F. Wisniewski Departent of Matheatics and Coputer Science Dartouth College Astract
More informationSupport Vector Machines MIT Course Notes Cynthia Rudin
Support Vector Machines MIT 5.097 Course Notes Cynthia Rudin Credit: Ng, Hastie, Tibshirani, Friedan Thanks: Şeyda Ertekin Let s start with soe intuition about argins. The argin of an exaple x i = distance
More informationMathematical Model and Algorithm for the Task Allocation Problem of Robots in the Smart Warehouse
Aerican Journal of Operations Research, 205, 5, 493-502 Published Online Noveber 205 in SciRes. http://www.scirp.org/journal/ajor http://dx.doi.org/0.4236/ajor.205.56038 Matheatical Model and Algorith
More informationOn Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40
On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering
More informationExperiment 2: Hooke s Law
COMSATS Institute of Inforation Technology, Islaabad Capus PHYS-108 Experient 2: Hooke s Law Hooke s Law is a physical principle that states that a spring stretched (extended) or copressed by soe distance
More informationTheoretical Computer Science
Theoretical Coputer Science 411 (2010) 22 43 Contents lists available at ScienceDirect Theoretical Coputer Science journal hoepage: www.elsevier.co/locate/tcs Theory of one-tape linear-tie Turing achines
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationM = (Q,Σ,δ,q 0,F) Σ is the alphabet over which the transitions are defined.
LECTURE 23 10.1 Formal Definition of a DFA Definition 10.1 A Deterministic Finite Automaton (DFA) M, is a five-tuple: where M = (Q,Σ,δ, 0,F) Q is a finite set of states. It is important that the set of
More informationA Markov Framework for the Simple Genetic Algorithm
A arkov Fraework for the Siple Genetic Algorith Thoas E. Davis*, Jose C. Principe Electrical Engineering Departent University of Florida, Gainesville, FL 326 *WL/NGS Eglin AFB, FL32542 Abstract This paper
More informationEstimation of the Mean of the Exponential Distribution Using Maximum Ranked Set Sampling with Unequal Samples
Open Journal of Statistics, 4, 4, 64-649 Published Online Septeber 4 in SciRes http//wwwscirporg/ournal/os http//ddoiorg/436/os4486 Estiation of the Mean of the Eponential Distribution Using Maiu Ranked
More informationSimulation of Discrete Event Systems
Siulation of Discrete Event Systes Unit 9 Queueing Models Fall Winter 207/208 Prof. Dr.-Ing. Dipl.-Wirt.-Ing. Sven Tackenberg Benedikt Andrew Latos M.Sc.RWTH Chair and Institute of Industrial Engineering
More informationELEMENTARY MARKOV QUEUEING SYSTEMS WITH UNRELIABLE SERVER
Nuber 4. Volue IV. Deceber 2009 EMENTARY MARKOV QUEUEING SYSTEMS WITH UNRIABLE SERVER Michal Dorda Suary:This paper presents soe exaples of eleentary Marov unreliable queueing systes and their atheatical
More informationModule #1: Units and Vectors Revisited. Introduction. Units Revisited EXAMPLE 1.1. A sample of iron has a mass of mg. How many kg is that?
Module #1: Units and Vectors Revisited Introduction There are probably no concepts ore iportant in physics than the two listed in the title of this odule. In your first-year physics course, I a sure that
More informationtime time δ jobs jobs
Approxiating Total Flow Tie on Parallel Machines Stefano Leonardi Danny Raz y Abstract We consider the proble of optiizing the total ow tie of a strea of jobs that are released over tie in a ultiprocessor
More informationCausal closure for MSC languages
FSTTCS 2006, 26th International Conference on Foundations of Software Technology and Theoretical Coputer Science Proceedings: R Raanuja, Sandeep Sen (eds.) Springer Lecture Notes in Coputer Science 3821
More informationPhysics 139B Solutions to Homework Set 3 Fall 2009
Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about
More informationIntroductory Physics Questions
Introductory Physics Questions (19th June 2015) These questions are taken fro end-of-ter and ake-up exas in 2013 and 2014. After today s class, you should e ale to answer Q1, Q2, Q3 and Q7. Q4, Q5, and
More information