IST 4 Information and Logic
|
|
- Ellen Anderson
- 5 years ago
- Views:
Transcription
1 IST 4 Informtion nd Logic
2 T = tody x= hw#x out x= hw#x due mon tue wed thr fri 31 M1 1 7 oh M1 14 oh 1 oh 2M2 21 oh oh 2 oh Mx= MQx out Mx= MQx due 28 oh M2 oh oh = office hours oh 3 T 4 oh oh 19 oh oh oh 5 midterms oh oh oh oh
3 Everything is 0-1 (Two Vlued)????
4 Logic to Physics Clude Shnnon s
5 Shnnon Shnnon s Bckground Clude Elwood Shnnon ws born in Petoskey, Michign, on April 30, 1916 In 1932 (16) he entered the University of Michign, where he took course tht introduced him to the work of George Boole He grduted d in 1936 (20) with two bchelor 's degrees, one in electricl engineering nd one in mthemtics Joined MIT in 1936, received the msters in electricl engineering nd doctorte in Mthemtics, t the 1940 (24) commencement
6 Shnnon s Inspirtion Joined MIT in 1936 Shnnon Vnnevr Bush Smuel Cldwell The differentil nlyzer t MIT (1931) ws the first generl eqution solver It could hndle sixth-order differentil equtions
7 Shnnon Connection Between Boolen Clculus nd Physicl Circuits Shnnon 1938 Hitchcock Shnnon s dvisor both MSc nd PhD mthemticin 76 yers go
8 Hitchcock Bush Sutherlnd ws fculty t Cltech from 1974 to 1978 (lso MS degree) Served s the founding chir of the CS Deprtment t Cltech Shnnon Ivn Sutherlnd 1938-
9 Shnnon Connection Between Boolen Clculus nd Physicl Circuits Shnnon 1938 Beginning: g No mention of computers... they did not exist A concept tht is missing in the text?
10 Logic to Physics The lnguge of lines s
11 Shnnon meets Boole Physics meets Logic A lnguge for synthesizing lrge physicl mchines for COMPUTING
12 Boolen Clculus nd Physicl Circuits Single Lines nd Composition The lnguge of lines: A line cn hve only two possible colors: blue or red Two lines cn be composed in two possible wys In prllel: In series:
13 Boolen Clculus nd Physicl Circuits Endpoints Lines hve endpoints Compositions hve endpoints Two lines cn be composed in two possible wys In prllel:
14 Boolen Clculus nd Physicl Circuits Endpoints Lines hve endpoints Compositions hve endpoints Two lines cn be composed in two possible wys In series:
15 Boolen Clculus nd Physicl Circuits Composition In prllel: Compositions of lines cn be composed in two different wys, using their endpoints b b
16 Boolen Clculus nd Physicl Circuits Composition In prllel: Compositions of lines cn be composed in two different wys, using their endpoints
17 Boolen Clculus nd Physicl Circuits Composition Compositions of lines cn be composed in two different wys, using their endpoints In series: b b
18 Boolen Clculus nd Physicl Circuits Composition In series: Compositions of lines cn be composed in two different wys, using their endpoints
19 Boolen Clculus nd Physicl Circuits Color of Composition Wht is the color of composition? color = blue color = red???
20 Boolen Clculus nd Physicl Circuits Color of Composition Wht is the color of composition? color = blue color = red The color of composition is red if there is red pth between the endpoints Otherwise, the color is blue
21 Is the two-color line composition 0-1 Boolen lgebr? Wht do we need to do??
22 Boolen Algebr Algebric system: set of elements B, two binry opertions + nd B hs t lest two elements (0 nd 1) If the following xioms re true then it is Boolen Algebr: A1. identity A2. complement A3. commuttive A4. distributive
23 Two-Colored Line Composition nd 0-1 Boolen Algebr Algebric system: set of elements B, two binry opertions + nd B hs t lest two elements (0 nd 1) Elements: 0 1
24 Two-Colored Line Composition nd 0-1 Boolen Algebr Algebric system: set of elements B, two binry opertions + nd B hs t lest two elements (0 nd 1) Elements: Opertions: Compose in prllel: The color of composition is red if there is red pth between the endpoints 0 1 Otherwise, the color is blue + Compose in series:
25 Two-Colored Line Composition nd 0-1 Boolen Algebr Algebric system: set of elements B, two binry opertions + nd B hs t lest two elements (0 nd 1) Elements: Opertions: Compose in prllel: blue prllel configurtion? Compose in series: red series configurtion?
26 Two-Colored Line Composition nd 0-1 Boolen Algebr 0 The color of the composition equls the color of + Compose in prllel The color of the composition i Compose in series equls the color of 1 The color of composition is red if there is red pth between the endpoints Otherwise, the color is blue
27 Two-Colored Line Composition nd 0-1 Boolen Algebr The color of the composition is red = 1 The color of the composition is blue = 0 + Compose in prllel Compose in series The color of composition is red if there is red pth between the endpoints. Otherwise, the color is blue
28 Two-Colored Line Composition nd 0-1 Boolen Algebr By the definition of the color of composition + Compose in prllel Compose in series The color of composition is red if there is red pth between the endpoints. Otherwise, the color is blue
29 Two-Colored Line Composition nd 0-1 Boolen Algebr b Two disjoint pths: The top one is determined by,the bottom one is bc b c c Includes the two pths nd bc Two other pths re b nd c determined d by so re redundnt
30 Is the two-color line composition 0-1 Boolen lgebr?
31 circuits = lgebr In Shnnon s words: We re now in position to demonstrte the equivlence of this clculus with certin elementry prts of the clculus of propositions. The lgebr of logic originted by George Boole, is symbolic method of investigting logicl reltionships. The symbols of Boolen lgebr dmit of two logicl interprettions. If interpreted in terms of clsses, the vribles re not limited to the two possible vlues 0 nd 1. E. V. Huntington' gives the following set of postultes for symbolic logic:
32 Shnnon Connection Between Boolen Clculus nd Physicl Circuits Shnnon 1938 Rely on the edge controlled by 0-1 vrible
33 Shnnon Connection Between Boolen Clculus nd Physicl Circuits Shnnon The vlue of circuit is 1 if there is connected pth between the endpoints Otherwise, it is The color of composition is red if there is red pth between the endpoints Otherwise, the color is blue
34 Rely Circuits nlysis nd synthesis s
35 nlysis of circuits..ny circuit is represented by set of equtions, The terms of the equtions corresponding to the vrious relys nd switches in the circuit. A A clculus is developed for mnipulting these equtions by simple mthemticl processes most of which re similr to ordinry lgebric lgorisms. This clculus is shown to be exctly nlogous to the clculus of propositions used in the symbolic study of logic.
36 synthesis of circuits For the synthesis problem the desired chrcteristics re first written s system of equtions, nd the equtions re then mnipulted into the form representing the simplest circuit. The circuit my then be immeditely drwn from the equtions. desired chrcteristic system of equtions simplified set of equtions simple circuit
37 synthesis of circuits For the synthesis problem the desired chrcteristics re first written s system of equtions, nd the equtions re then mnipulted into the form representing the simplest circuit. The circuit my then be immeditely drwn from the equtions. desired chrcteristic Logic design is born! system of equtions Complexity? simplified set of equtions simple circuit
38
39 The First Book on Switching Circuits Keister, Ritchie nd Wshburn, Willim Keister
40 SpinOut Keister Willim Keister Keister Willim Keister ws pioneer in switching theory nd design t Bell Lbs When he retired in 1972, he ws director of Bell Lbs' Computing Technology Center t Holmdel, New Jersey. Keister begn working in his spre time to prove tht puzzles could be solved using Boolen lgebr U S Ptent (1972): SpinOut U.S. Ptent (1972): SpinOut U.S. Ptent (1972): The Hexdeciml Puzzle
41 The First Book on Switching Circuits Keister, Ritchie nd Wshburn, 1951 C nd Unix Dennis Ritchie Son of
42 The First Book on Switching Circuits Keister, Ritchie nd Wshburn, 1951 Being recognized by the president with co-inventor Ken Thompson C nd Unix Dennis Ritchie Son of
43 The First Book on Switching Circuits Keister, Ritchie nd Wshburn, 1951
44 Rely Circuits nlysis s
45 A rely circuit it corresponds to formul rely circuits Boolen functions Boolen sum of ll the pths between endpoints
46 Anlysis of Rely Circuits Exmple 1: - series-prllel - independent pths between endpoints d b c e b c d e
47 Exmple 1: - series-prllel - independent pths between endpoints b d c e b c d e
48 Exmple 1: - series-prllel - independent pths between endpoints b d c e b c d e
49 Exmple 1: - series-prllel - independent pths between endpoints b d c e b c d e
50 Exmple 1: - series-prllel - independent pths between endpoints b d c e b c d e
51 Anlysis of Rely Circuits Exmple 2: - non series-prllel - dependent pths between endpoints b c d e
52 Anlysis of Rely Circuits b c d e
53 Anlysis of Rely Circuits b c d e
54 Anlysis of Rely Circuits b c d e
55 Anlysis of Rely Circuits b c d e
56 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) How mny functions? b c d e
57 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) b c d e
58 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) b c d e
59 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) b c d e
60 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) b c d e
61 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) b c d e
62 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) b c d e
63 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) b c d e
64 Anlysis of Rely Circuits Exmple 4: - series-prllel - MANY dependent pths between endpoints Q: how mny FORWARD pths?
65 Anlysis of Rely Circuits Exmple 4: - series-prllel - MANY dependent pths between endpoints Q: how mny FORWARD pths? 3X3X3X3 =81
66 Anlysis of Rely Circuits Exmple 4: - series-prllel - MANY dependent pths between endpoints Red = vrible Blue = complement of b b b d c c d e
67 Anlysis of Rely Circuits Exmple 4: - series-prllel - MANY dependent pths between endpoints Red = vrible Blue = complement of b b b d c c d e Q: Is (=0, b=1, c=1, d=1, e=1) stisfying ssignment? NO
68 Anlysis of Rely Circuits Exmple 4: - series-prllel - MANY dependent pths between endpoints Red = vrible Blue = complement of b b b d c c d e Q: Is (=1, b=1, c=1, d=1, e=1) stisfying ssignment? YES
69 Anlysis of Rely Circuits Exmple 5: - series-prllel - MANY dependent pths between endpoints Red = vrible b Blue = complement of b b c b c Q: Is there stisfying ssignment?? NO
70 Anlysis of Rely Circuits Exmple 5: - series-prllel - MANY dependent pths between endpoints Red = vrible b Blue = complement of b b c b c Q: Is there stisfying ssignment? b must be 1
71 Anlysis of Rely Circuits Exmple 5: - series-prllel - MANY dependent pths between endpoints Red = vrible b Blue = complement of b b c b c Q: Is there stisfying ssignment? b must be 0 Contrdiction!
72 Questions on stisfying (SAT) ssignments? Efficient lgorizms? Is given ssignment stisfying? Is there stisfying ssignment? YES NO
73 Anlysis of Rely Circuits it lgorithms nd complexity P vs NP s
74 Complexity clss NP There is n efficient lgorizm for verifying given SAT solution b b b d c c d e
75 Complexity clss P There is n efficient i lgorizm for finding SAT ssignment b b b c b c
76 NP: There is n efficient lgorizm for verifying given SAT solution P: There is n efficient lgorizm for finding SAT ssignment Q: How re NP nd P relted? NP P NO P NP YES
77 Finding stisfying ssignment is computtionlly difficult problem computtionlly difficult is formlly clled NP-Complete
78 NP-complete problem for width 3 However, there is n efficient lgorizm for width 2 b b b d c c d e b b b c b c
79 NP-Complete The lnguge of hrd problems An NP-complete problem is Mgic box for ny problem in NP Cn solve it cn solve ll!!
80 Finding stisfying ssignment is computtionlly difficult problem I cn't find n efficient lgorizm, I guess I'm just too dumb... Source: Computers nd Intrctbility, by Grey nd Johnson
81 Finding stisfying ssignment is computtionlly difficult problem I cn't find n efficient lgorizm, becuse no such lgorizm is possible! Source: Computers nd Intrctbility, by Grey nd Johnson
82 Finding stisfying ssignment is computtionlly difficult problem I cn't find n efficient lgorizm, but neither cn ll these fmous people Source: Computers nd Intrctbility, by Grey nd Johnson
83 Finding stisfying ssignment is computtionlly difficult problem I showed it is NP-Complete And ll of these smrt people encountered other NPcomplete problems... And could not solve it, yet... Source: Computers nd Intrctbility, by Grey nd Johnson
84 Finding stisfying ssignment is computtionlly difficult problem Stephen Cook NP-complete complete, My 1971 I cn't find n efficient lgorizm, but neither cn ll these fmous people Source: Computers nd Intrctbility, by Grey nd Johnson
85 The most importnt ide in Informtion Finite it Universlity Lnguge of Cn construct everything from finite set of building blocks
86 Is there finite universl set of building blocks? Cn construct everything. DNA ABCDE... +, -, x, / M-boxes
87 Wht is the function?
88 Wht Anlysis is the of Rely function? Circuits Red = vrible b Blue = complement of c b c d b c d b c
89 Wht Anlysis is the of Rely function? Circuits Red = vrible Blue = complement of odd prity even prity The key: 1 cuses switch in prity 0 keeps the prity the sme
90 Wht Anlysis is the of Rely function? Circuits Red = vrible Blue = complement of odd prity even prity The key: 1 cuses switch in prity 0 keeps the prity the sme
91 Wht Anlysis is the of Rely function? Circuits Red = vrible Blue = complement of odd prity even prity The key: 1 cuses switch in prity 0 keeps the prity the sme
92 Importnt note Shnnon Used the Dul Nottion In this HW set use the nottion from clss! 1 = closed circuit 0 = open circuit
93
94
95
96
97
98
IST 4 Information and Logic
IST 4 Informtion nd Logic T = tody x= hw#x out x= hw#x due mon tue wed thr 28 M1 oh 1 4 oh M1 11 oh oh 1 2 M2 18 oh oh 2 fri oh oh = office hours oh 25 oh M2 2 3 oh midterms oh Mx= MQx out 9 oh 3 T 4 oh
More informationIST 4 Information and Logic
IST 4 Informtion nd Logic mon tue wed thr fri sun T = tody 3 M1 oh 1 x= hw#x out 10 oh M1 17 oh oh 1 2 M2 oh oh x= hw#x due 24 oh oh 2 oh = office hours oh 1 oh M2 8 3 oh midterms oh oh Mx= MQx out 15
More informationBoolean algebra.
http://en.wikipedi.org/wiki/elementry_boolen_lger Boolen lger www.tudorgir.com Computer science is not out computers, it is out computtion nd informtion. computtion informtion computer informtion Turing
More informationGreen s function. Green s function. Green s function. Green s function. Green s function. Green s functions. Classical case (recall)
Green s functions 3. G(t, τ) nd its derivtives G (k) t (t, τ), (k =,..., n 2) re continuous in the squre t, τ t with respect to both vribles, George Green (4 July 793 3 My 84) In 828 Green privtely published
More informationBoolean Algebra. Boolean Algebras
Boolen Algebr Boolen Algebrs A Boolen lgebr is set B of vlues together with: - two binry opertions, commonly denoted by + nd, - unry opertion, usully denoted by or ~ or, - two elements usully clled zero
More informationArithmetic & Algebra. NCTM National Conference, 2017
NCTM Ntionl Conference, 2017 Arithmetic & Algebr Hether Dlls, UCLA Mthemtics & The Curtis Center Roger Howe, Yle Mthemtics & Texs A & M School of Eduction Relted Common Core Stndrds First instnce of vrible
More informationAnatomy of a Deterministic Finite Automaton. Deterministic Finite Automata. A machine so simple that you can understand it in less than one minute
Victor Admchik Dnny Sletor Gret Theoreticl Ides In Computer Science CS 5-25 Spring 2 Lecture 2 Mr 3, 2 Crnegie Mellon University Deterministic Finite Automt Finite Automt A mchine so simple tht you cn
More informationELE B7 Power System Engineering. Unbalanced Fault Analysis
Power System Engineering Unblnced Fult Anlysis Anlysis of Unblnced Systems Except for the blnced three-phse fult, fults result in n unblnced system. The most common types of fults re single lineground
More informationReasoning and programming. Lecture 5: Invariants and Logic. Boolean expressions. Reasoning. Examples
Chir of Softwre Engineering Resoning nd progrmming Einführung in die Progrmmierung Introduction to Progrmming Prof. Dr. Bertrnd Meyer Octoer 2006 Ferury 2007 Lecture 5: Invrints nd Logic Logic is the sis
More informationHow do you know you have SLE?
Simultneous Liner Equtions Simultneous Liner Equtions nd Liner Algebr Simultneous liner equtions (SLE s) occur frequently in Sttics, Dynmics, Circuits nd other engineering clsses Need to be ble to, nd
More information8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers.
8. Complex Numers The rel numer system is dequte for solving mny mthemticl prolems. But it is necessry to extend the rel numer system to solve numer of importnt prolems. Complex numers do not chnge the
More information8 Laplace s Method and Local Limit Theorems
8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved
More informationIntuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras
Intuitionistic Fuzzy Lttices nd Intuitionistic Fuzzy oolen Algebrs.K. Tripthy #1, M.K. Stpthy *2 nd P.K.Choudhury ##3 # School of Computing Science nd Engineering VIT University Vellore-632014, TN, Indi
More informationDually quasi-de Morgan Stone semi-heyting algebras II. Regularity
Volume 2, Number, July 204, 65-82 ISSN Print: 2345-5853 Online: 2345-586 Dully qusi-de Morgn Stone semi-heyting lgebrs II. Regulrity Hnmntgoud P. Snkppnvr Abstrct. This pper is the second of two prt series.
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationLesson 1: Quadratic Equations
Lesson 1: Qudrtic Equtions Qudrtic Eqution: The qudrtic eqution in form is. In this section, we will review 4 methods of qudrtic equtions, nd when it is most to use ech method. 1. 3.. 4. Method 1: Fctoring
More informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
More informationSection 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationIntegrals along Curves.
Integrls long Curves. 1. Pth integrls. Let : [, b] R n be continuous function nd let be the imge ([, b]) of. We refer to both nd s curve. If we need to distinguish between the two we cll the function the
More informationOverview of Calculus I
Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,
More informationOrdinary differential equations
Ordinry differentil equtions Introduction to Synthetic Biology E Nvrro A Montgud P Fernndez de Cordob JF Urchueguí Overview Introduction-Modelling Bsic concepts to understnd n ODE. Description nd properties
More informationLinearly Similar Polynomials
Linerly Similr Polynomils rthur Holshouser 3600 Bullrd St. Chrlotte, NC, US Hrold Reiter Deprtment of Mthemticl Sciences University of North Crolin Chrlotte, Chrlotte, NC 28223, US hbreiter@uncc.edu stndrd
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationarxiv:math/ v2 [math.ho] 16 Dec 2003
rxiv:mth/0312293v2 [mth.ho] 16 Dec 2003 Clssicl Lebesgue Integrtion Theorems for the Riemnn Integrl Josh Isrlowitz 244 Ridge Rd. Rutherford, NJ 07070 jbi2@njit.edu Februry 1, 2008 Abstrct In this pper,
More informationNatural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring
More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),
More informationGood Review book ( ) ( ) ( )
7/31/2011 34 Boolen (Switching) Algebr Review Good Review book BeBop to the Boolen Boogie: An Unconventionl Guide to Electronics, 2 nd ed. by Clive Mxwell Hightext Publictions Inc. from Amzon.com for pprox.
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationState Minimization for DFAs
Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid
More informationElementary Mathematical Concepts and Operations
Elementry Mthemticl Concepts nd Opertions After studying this chpter you should be ble to: dd, subtrct, multiply nd divide positive nd negtive numbers understnd the concept of squre root expnd nd evlute
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationCS5371 Theory of Computation. Lecture 20: Complexity V (Polynomial-Time Reducibility)
CS5371 Theory of Computtion Lecture 20: Complexity V (Polynomil-Time Reducibility) Objectives Polynomil Time Reducibility Prove Cook-Levin Theorem Polynomil Time Reducibility Previously, we lernt tht if
More informationThe practical version
Roerto s Notes on Integrl Clculus Chpter 4: Definite integrls nd the FTC Section 7 The Fundmentl Theorem of Clculus: The prcticl version Wht you need to know lredy: The theoreticl version of the FTC. Wht
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationCS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)
CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts
More informationIntroduction to the Calculus of Variations
Introduction to the Clculus of Vritions Jim Fischer Mrch 20, 1999 Abstrct This is self-contined pper which introduces fundmentl problem in the clculus of vritions, the problem of finding extreme vlues
More informationSemigroup of generalized inverses of matrices
Semigroup of generlized inverses of mtrices Hnif Zekroui nd Sid Guedjib Abstrct. The pper is divided into two principl prts. In the first one, we give the set of generlized inverses of mtrix A structure
More informationDATABASE DESIGN I - 1DL300
DATABASE DESIGN I - DL300 Fll 00 An introductory course on dtse systems http://www.it.uu.se/edu/course/homepge/dstekn/ht0/ Mnivskn Sesn Uppsl Dtse Lortory Deprtment of Informtion Technology, Uppsl University,
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationThe Riemann-Lebesgue Lemma
Physics 215 Winter 218 The Riemnn-Lebesgue Lemm The Riemnn Lebesgue Lemm is one of the most importnt results of Fourier nlysis nd symptotic nlysis. It hs mny physics pplictions, especilly in studies of
More informationGeneralized Fano and non-fano networks
Generlized Fno nd non-fno networks Nildri Ds nd Brijesh Kumr Ri Deprtment of Electronics nd Electricl Engineering Indin Institute of Technology Guwhti, Guwhti, Assm, Indi Emil: {d.nildri, bkri}@iitg.ernet.in
More informationIntroduction to Group Theory
Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationMath 4310 Solutions to homework 1 Due 9/1/16
Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1
More informationMatrices. Elementary Matrix Theory. Definition of a Matrix. Matrix Elements:
Mtrices Elementry Mtrix Theory It is often desirble to use mtrix nottion to simplify complex mthemticl expressions. The simplifying mtrix nottion usully mkes the equtions much esier to hndle nd mnipulte.
More information332:221 Principles of Electrical Engineering I Fall Hourly Exam 2 November 6, 2006
2:221 Principles of Electricl Engineering I Fll 2006 Nme of the student nd ID numer: Hourly Exm 2 Novemer 6, 2006 This is closed-ook closed-notes exm. Do ll your work on these sheets. If more spce is required,
More informationControl with binary code. William Sandqvist
Control with binry code Dec Bin He Oct 218 10 11011010 2 DA 16 332 8 E 1.1c Deciml to Binäry binry weights: 1024 512 256 128 64 32 16 8 4 2 1 71 10? 2 E 1.1c Deciml to Binäry binry weights: 1024 512 256
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
More informationNumerical Linear Algebra Assignment 008
Numericl Liner Algebr Assignment 008 Nguyen Qun B Hong Students t Fculty of Mth nd Computer Science, Ho Chi Minh University of Science, Vietnm emil. nguyenqunbhong@gmil.com blog. http://hongnguyenqunb.wordpress.com
More informationPre-Session Review. Part 1: Basic Algebra; Linear Functions and Graphs
Pre-Session Review Prt 1: Bsic Algebr; Liner Functions nd Grphs A. Generl Review nd Introduction to Algebr Hierrchy of Arithmetic Opertions Opertions in ny expression re performed in the following order:
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More information12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2014
CS125 Lecture 12 Fll 2014 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple
More informationWe will see what is meant by standard form very shortly
THEOREM: For fesible liner progrm in its stndrd form, the optimum vlue of the objective over its nonempty fesible region is () either unbounded or (b) is chievble t lest t one extreme point of the fesible
More informationTHE NUMBER CONCEPT IN GREEK MATHEMATICS SPRING 2009
THE NUMBER CONCEPT IN GREEK MATHEMATICS SPRING 2009 0.1. VII, Definition 1. A unit is tht by virtue of which ech of the things tht exist is clled one. 0.2. VII, Definition 2. A number is multitude composed
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More information4.4 Areas, Integrals and Antiderivatives
. res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order
More informationName of the Student:
SUBJECT NAME : Discrete Mthemtics SUBJECT CODE : MA 2265 MATERIAL NAME : Formul Mteril MATERIAL CODE : JM08ADM009 Nme of the Student: Brnch: Unit I (Logic nd Proofs) 1) Truth Tble: Conjunction Disjunction
More informationLinear Network Codes and Systems of Polynomial Equations
1 Liner Network Codes nd Systems of Polynomil Equtions Rndll Dougherty, Chris Freiling, nd Kenneth Zeger (Submitted to ISIT 2008) Abstrct If β nd γ re nonnegtive integers nd F is field, then polynomil
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More informationARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac
REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationTHE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p
THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ
More informationRELATIONAL MODEL.
RELATIONAL MODEL Structure of Reltionl Dtbses Reltionl Algebr Tuple Reltionl Clculus Domin Reltionl Clculus Extended Reltionl-Algebr- Opertions Modifiction of the Dtbse Views EXAMPLE OF A RELATION BASIC
More information1 2-D Second Order Equations: Separation of Variables
Chpter 12 PDEs in Rectngles 1 2-D Second Order Equtions: Seprtion of Vribles 1. A second order liner prtil differentil eqution in two vribles x nd y is A 2 u x + B 2 u 2 x y + C 2 u y + D u 2 x + E u +
More informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
More informationMore on automata. Michael George. March 24 April 7, 2014
More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More informationand that at t = 0 the object is at position 5. Find the position of the object at t = 2.
7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we
More informationCNS 188a Computation Theory and Neural Systems. Monday and Wednesday 1:30-3:00 Moore 080
CNS 88a Computation Theory and Neural Systems Monday and Wednesday :30-3:00 Moore 080 Lecturer: Shuki Bruck; 33 Moore office hours: Mon, Wed, 3-4pm TAs: Vincent Bohossian, Matt Cook; 3 Moore office hours:
More informationCLASSROOM NOTE Some new mean value theorems of Flett type
Interntionl Journl of Mthemticl Eduction in Science nd Technology 014 http://dxdoiorg/101080/000739x01490457 CLASSROOM NOTE Some new men vlue theorems of Flett type Chenggun Tn nd Songxio Li Deprtment
More informationMORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
More informationChapter 8.2: The Integral
Chpter 8.: The Integrl You cn think of Clculus s doule-wide triler. In one width of it lives differentil clculus. In the other hlf lives wht is clled integrl clculus. We hve lredy eplored few rooms in
More informationBoolean Algebra. Boolean Algebra
Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with: - two inry opertions, commonly denoted y + nd, - unry opertion, usully denoted y ˉ or ~ or, - two elements usully clled zero nd
More informationCS375: Logic and Theory of Computing
CS375: Logic nd Theory of Computing Fuhu (Frnk) Cheng Deprtment of Computer Science University of Kentucky 1 Tble of Contents: Week 1: Preliminries (set lgebr, reltions, functions) (red Chpters 1-4) Weeks
More informationBefore we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!
Nme: Algebr II Honors Pre-Chpter Homework Before we cn begin Ch on Rdicls, we need to be fmilir with perfect squres, cubes, etc Try nd do s mny s you cn without clcultor!!! n The nth root of n n Be ble
More informationThe final exam will take place on Friday May 11th from 8am 11am in Evans room 60.
Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23
More informationSTEP FUNCTIONS, DELTA FUNCTIONS, AND THE VARIATION OF PARAMETERS FORMULA. 0 if t < 0, 1 if t > 0.
STEP FUNCTIONS, DELTA FUNCTIONS, AND THE VARIATION OF PARAMETERS FORMULA STEPHEN SCHECTER. The unit step function nd piecewise continuous functions The Heviside unit step function u(t) is given by if t
More informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationA Criterion on Existence and Uniqueness of Behavior in Electric Circuit
Institute Institute of of Advnced Advnced Engineering Engineering nd nd Science Science Interntionl Journl of Electricl nd Computer Engineering (IJECE) Vol 6, No 4, August 2016, pp 1529 1533 ISSN: 2088-8708,
More informationContinuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht
More informationDIRECT CURRENT CIRCUITS
DRECT CURRENT CUTS ELECTRC POWER Consider the circuit shown in the Figure where bttery is connected to resistor R. A positive chrge dq will gin potentil energy s it moves from point to point b through
More informationThe Algebra (al-jabr) of Matrices
Section : Mtri lgebr nd Clculus Wshkewicz College of Engineering he lgebr (l-jbr) of Mtrices lgebr s brnch of mthemtics is much broder thn elementry lgebr ll of us studied in our high school dys. In sense
More informationHandout: Natural deduction for first order logic
MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes
More informationFinite-State Automata: Recap
Finite-Stte Automt: Recp Deepk D Souz Deprtment of Computer Science nd Automtion Indin Institute of Science, Bnglore. 09 August 2016 Outline 1 Introduction 2 Forml Definitions nd Nottion 3 Closure under
More informationThe area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationChapter 5 : Continuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 216 Néhémy Lim Chpter 5 : Continuous Rndom Vribles Nottions. N {, 1, 2,...}, set of nturl numbers (i.e. ll nonnegtive integers); N {1, 2,...}, set of ll
More informationResults on Planar Near Rings
Interntionl Mthemticl Forum, Vol. 9, 2014, no. 23, 1139-1147 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/10.12988/imf.2014.4593 Results on Plnr Ner Rings Edurd Domi Deprtment of Mthemtics, University
More information1.4 Nonregular Languages
74 1.4 Nonregulr Lnguges The number of forml lnguges over ny lphbet (= decision/recognition problems) is uncountble On the other hnd, the number of regulr expressions (= strings) is countble Hence, ll
More information(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer
Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.
More informationOne Variable Advanced Calculus. Kenneth Kuttler
One Vrible Advnced Clculus Kenneth Kuttler August 5, 2009 2 Contents 1 Introduction 7 2 The Rel And Complex Numbers 9 2.1 The Number Line And Algebr Of The Rel Numbers.......... 9 2.2 Exercises...................................
More informationIntegrals - Motivation
Integrls - Motivtion When we looked t function s rte of chnge If f(x) is liner, the nswer is esy slope If f(x) is non-liner, we hd to work hrd limits derivtive A relted question is the re under f(x) (but
More informationDeterministic Finite-State Automata
Deterministic Finite-Stte Automt Deepk D Souz Deprtment of Computer Science nd Automtion Indin Institute of Science, Bnglore. 12 August 2013 Outline 1 Introduction 2 Exmple DFA 1 DFA for Odd number of
More informationCS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
More informationCS 275 Automata and Formal Language Theory
CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) Anton Setzer (Bsed on book drft by J. V. Tucker nd K. Stephenson)
More information