Mathematics, Proofs and Computation
|
|
- Rosaline McLaughlin
- 6 years ago
- Views:
Transcription
1 Mathematics, Proofs and Computation Madhu Sudan Harvard January 4, 2016 IIT-Bombay: Math, Proofs, Computing 1 of 25
2 Logic, Mathematics, Proofs Reasoning: Start with body of knowledge. Add to body of knowledge by new observations, and new deductions Process susceptible to errors: One erroneous observation may propagate. Constant process of consistency checking. Mathematics = Language of Precision Captures (subset of) knowledge precisely. Proofs: Enable checking of consistency of precisely stated facts. January 4, 2016 IIT-Bombay: Math, Proofs, Computing 2 of 25
3 In this talk: Proofs and Computation Computer Assisted Proofs? [Appel-Haken] 4-color theorem [Hales] Kepler Conjecture [Petkovsky,Wilf,Zeilberger] A=B No! Mathematics Proofs Computing January 4, 2016 IIT-Bombay: Math, Proofs, Computing 3 of 25
4 Formal Logic Attempts to convert reasoning to symbolic manipulation. Remarkably powerful. Originated independently, and with different levels of impact, in different civilizations Mathematics Proofs "Aristotle Altemps Inv8575" by Copy of Lysippus - Jastrow (2006). Licensed under Public Domain via Commons - January 4, 2016 IIT-Bombay: Math, Proofs, Computing 4 of 25
5 George Boole ( ) Mathematics Proofs The strange math of ( 0,1 ;,, ) Typical Derivation: Axiom: Repitition does not add knowledge Formally: xxxx = xx Example: Object is Good and Good Object is Good Consequence: Principle of Contradiction it is impossible for any being to possess a quality and at the same time to not possess it. Proof: xx 2 = xx xx 2 xx = 0 xx xx 1 = 0 xx = 0 or xx 1 xx = 0 xx or xx does not hold (page 34) January 4, 2016 IIT-Bombay: Math, Proofs, Computing 5 of 25
6 R, Q, Z vs. {00, 11} Boole s Mathematics: Focus on tiny part of mathematical universe. R: Algebra/Calculus Progress In Math Q: optimization Z: number theory {0,1} January 4, 2016 IIT-Bombay: Math, Proofs, Computing 6 of 25
7 Boole s modest ambition The design of the following treatise is to investigate the fundamental laws of those operations of the mind by which reasoning is performed; to give expression to them in the symbolical language of a Calculus, and upon this foundation to establish the science of Logic and construct its method; to make that method itself the basis of a general method for the application of the mathematical doctrine of Probabilities; and, finally, to collect from the various elements of truth brought to view in the course of these inquiries some probable intimations concerning the nature and constitution of the human mind. [G.Boole, On the laws of thought p.1] R: Algebra/Calculus Q: optimization Z: number theory Mathematics All of reasoning {0,1} {0,1} January 4, 2016 IIT-Bombay: Math, Proofs, Computing 7 of 25
8 Whither Computing? How well does the logic capture mathematics? Cantor 1890: Logic may face some problems? Hilbert 1900: Should capture everything! Godel 1920s: Incompleteness This statement Church-Turing 1930s: Incompleteness holds for any effective reasoning procedure. is not provable true January 4, 2016 IIT-Bombay: Math, Proofs, Computing 8 of 25
9 Turing s Machine Mathematics Computing Proofs Encodings of other machines Model of computer - Universal! von Neumann architecture Universal Machine Finite State CPU Control R/W RAM One machine to rule them all! January 4, 2016 IIT-Bombay: Math, Proofs, Computing 9 of 25
10 Proofs: Story so far Proof: Has to be mechanically verifiable. Theorem: Statement with a proof. Incompleteness: There exist statements consistent with the system of logic that do not admit a proof. Unaddressed: What difference does proof make? Theorem: TT Theorem: TT #steps ~l Proof: Π 1 Π 2 Π 3 Π 4 Π l = TT Both mechanically verifiable! Proof: Has l lines ~2 l January 4, 2016 IIT-Bombay: Math, Proofs, Computing 10 of 25
11 Origins of Modern Complexity [Gödel 1956] in letter to von Neumann: Is there a more effective procedure to find proof of length l if one exists? (in l 2 steps? l l 2?) [Cobham, Edmonds, Hartmanis, Stearns 60s]: Time Complexity is a (coarse) measure. 10l 2 = 5l 2! But l 2 > l 1.9. PP problems solvable in time l cc for constant cc Edmonds Conjecture: Travelling Salesman Problem is not solvable in PP January 4, 2016 IIT-Bombay: Math, Proofs, Computing 11 of 25
12 Proofs, Complexity & Optimization! [Cook 70] Complexity of Theorem Proving [Levin 71] Universal Search problems Formalized Edmond s Conjecture: NNNN = Problems w. efficiently verifiable solutions NNNN-complete = Hardest problem in NP Theorem-Proving NP-Complete SAT (simple format of proofs) NP-complete Domino tiling NP-Complete Godel s question Is NNNN = PP? January 4, 2016 IIT-Bombay: Math, Proofs, Computing 12 of 25
13 Proofs, Complexity & Optimization - 2 [Karp 72] Reducibility among combinatorial optimization problems Showed central importance of NNNN. Nineteen problems NNNN-Complete! Cover optimization, logic, combinatorics, graph theory, chip design. January 4, 2016 IIT-Bombay: Math, Proofs, Computing 13 of 25
14 Some NP-complete Problems Map Coloring: Can you color a given map with 3- colors, s.t. bordering states have diff. colors? January 4, 2016 IIT-Bombay: Math, Proofs, Computing 14 of 25
15 Some NP-Complete Problems Travelling Salesman Problem: (TSP) Find tour of minimum length visiting given set of cities. Image due to [Applegate, Bixby, Chvatal, Cook]. Optimal TSP visiting ~13000 most populated cities in US. January 4, 2016 IIT-Bombay: Math, Proofs, Computing 15 of 25
16 Some NP-Complete Problems Biology: Fold DNA sequence so as to minimize energy. Economics: Finding optimal portfolio of stocks subject to budget constraint. Industrial Engineering: Schedule tasks subject to precedence constraints to minimize completion time. January 4, 2016 IIT-Bombay: Math, Proofs, Computing 16 of 25
17 Consequences to Proof Checking NP-Complete problem Format for proofs. 3-coloring is NP-complete exists function ff ff TT, l = Map with l cc regions s.t. TT has proof of length l Map is 3-colorable no proofs of length l Map not 3-colorable Format? Rather than convention proof, can simply give coloring of map! Verifier computes ff(tt, l) and verifies coloring is good Advantage: Error is local (two improperly colored regions) January 4, 2016 IIT-Bombay: Math, Proofs, Computing 17 of 25
18 Is P=NP? Don t know If P=NP Of all the Clay Problems, this might be the one to find the shortest solution, by an amateur mathematician. Cryptography might well be impossible (current systems all broken simultaneously) All optimization problems become easy You get whatever you wish if you can verify satisfaction. Mathematicians replaced by computers. - Devlin, The Millenium Problems (Possibly thinking P=NP) If someone shows P=NP, then they prove any theorem they If P NP wish. So they would walk away not just with $1M, but $6M by solving all the Clay Problems! Consistent with current thinking, so no radical changes. Proof would be very educational. Might provide sound cryptosystems. - Lance Fortnow, Complexity Blog Independent P = NP? of Peano s is Mathematics-Complete axioms, Choice!!? January 4, 2016 IIT-Bombay: Math, Proofs, Computing 18 of 25
19 Post-Modern Complexity Emphasis on Randomness. Randomness can potentially speed up algorithms. Essential for Equilibrium behavior Coordination among multiple players Cryptography But it probably can t help with Logic right? Actually it does!! January 4, 2016 IIT-Bombay: Math, Proofs, Computing 19 of 25
20 Interactive Proofs [Goldwasser, Micali, Rackoff], [Babai] ~1985 Verifier asks questions and Prover responds: Space of questions exponentially large in the length! Prover has to be ready for all! Many striking examples: Pepsi Coke! ( Graphs not isomorphic ) Can prove theorem has no short proof. IP = PSPACE [LFKN, Shamir] Zero Knowledge Protocols Foundations of Secure communication January 4, 2016 IIT-Bombay: Math, Proofs, Computing 20 of 25
21 Probabilistically Checkable Proofs Do proofs have to be read in entirety to verify? January 4, 2016 IIT-Bombay: Math, Proofs, Computing 21 of 25
22 Probabilistically Checkable Proofs Do proofs have to be read in entirety to verify? Conventional formats for proofs YES! But we can change the format! Format Verification Algorithm Any verifier is ok, provided: If TT has proof of length l in standard system, then VV should accept some proof of length poly(l) If TT has no proofs, then VV should not accept any proof with probability 1 2X.001 PCP Theorem [Arora, Lund, Motwani, Safra, Sudan, Szegedy 92]: A format exists where V reads only constant number of bits of proof! January 4, 2016 IIT-Bombay: Math, Proofs, Computing 22 of 25
23 PCPs and Optimization Classical connection: [Cook Karp]: Solving optimization problems finding proofs New Connection: [Feige et al., Arora et al.] Solving optimization problems approximately finding nearly valid proofs. Existence of nearly valid proofs Existence of perfectly valid proofs (due to PCPs)! Conclude: Solving (some/many) optimizations approximately is as hard as solving them exactly! 1992-today: PCP-induced revolution in understanding approximability!! January 4, 2016 IIT-Bombay: Math, Proofs, Computing 23 of 25
24 Summary and Conclusions Computing is a science: Goes to the very heart of scientific inquiry. What big implications follow from local steps? Search for proofs captures essence of all search and optimization. Is P=NP? Central mathematical question. Still open. But lots of progress Khot s UGC (Unique Games Conjecture): Cutting edge of optimization. January 4, 2016 IIT-Bombay: Math, Proofs, Computing 24 of 25
25 Thank You! January 4, 2016 IIT-Bombay: Math, Proofs, Computing 25 of 25
Logical Foundations of Mathematics and Computational Complexity a gentle introduction
Pavel Pudlák Logical Foundations of Mathematics and Computational Complexity a gentle introduction January 18, 2013 Springer i Preface As the title states, this book is about logic, foundations and complexity.
More informationBeyond Worst Case Analysis in Approxima4on Uriel Feige The Weizmann Ins2tute
Beyond Worst Case Analysis in Approxima4on Uriel Feige The Weizmann Ins2tute 1 Plan of talk Survey some known approxima2on algorithms and open ques2ons for worst case and random instances of: max-3sat
More informationCSE 101. Algorithm Design and Analysis Miles Jones Office 4208 CSE Building Lecture 9: Greedy
CSE 101 Algorithm Design and Analysis Miles Jones mej016@eng.ucsd.edu Office 4208 CSE Building Lecture 9: Greedy GENERAL PROBLEM SOLVING In general, when you try to solve a problem, you are trying to find
More informationLecture 3: Nondeterministic Computation
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 3: Nondeterministic Computation David Mix Barrington and Alexis Maciel July 19, 2000
More informationFrom Pythagoras to the Digital Computer: The Intellectual Roots of Symbolic Artificial Intelligence
From Pythagoras to the Digital Computer: The Intellectual Roots of Symbolic Artificial Intelligence Volume I of Word and Flux: The Discrete and the Continuous In Computation, Philosophy, and Psychology
More informationScientific Philosophy
Scientific Philosophy Gustavo E. Romero IAR-CONICET/UNLP, Argentina FCAGLP, UNLP, 2018 Philosophy of mathematics The philosophy of mathematics is the branch of philosophy that studies the philosophical
More informationLogic Design ( Part 3) Sequential Logic- Finite State Machines (Chapter 3)
Logic esign ( Part ) Sequential Logic- Finite State Machines (Chapter ) Based on slides McGraw-Hill Additional material 00/00/006 Lewis/Martin Additional material 008 Roth Additional material 00 Taylor
More informationPart I: Graph Coloring
Part I: Graph Coloring At some point in your childhood, chances are you were given a blank map of the United States, of Africa, of the whole world and you tried to color in each state or each country so
More informationLogic and Philosophy of Science (LPS)
Logic and Philosophy of Science (LPS) 1 Logic and Philosophy of Science (LPS) Courses LPS 29. Critical Reasoning. 4 Units. Introduction to analysis and reasoning. The concepts of argument, premise, and
More informationPeirce's Remarkable Rules of Inference
Peirce's Remarkable Rules of Inference John F. Sowa Abstract. The rules of inference that Peirce invented for existential graphs are the simplest, most elegant, and most powerful rules ever proposed for
More informationExample: compressing black and white images 2 Say we are trying to compress an image of black and white pixels: CSC310 Information Theory.
CSC310 Information Theory Lecture 1: Basics of Information Theory September 11, 2006 Sam Roweis Example: compressing black and white images 2 Say we are trying to compress an image of black and white pixels:
More information2 nd Int. Conf. CiiT, Molika, Dec CHAITIN ARTICLES
2 nd Int. Conf. CiiT, Molika, 20-23.Dec.2001 93 CHAITIN ARTICLES D. Gligoroski, A. Dimovski Institute of Informatics, Faculty of Natural Sciences and Mathematics, Sts. Cyril and Methodius University, Arhimedova
More informationCorcoran, J George Boole. Encyclopedia of Philosophy. 2nd edition. Detroit: Macmillan Reference USA, 2006
Corcoran, J. 2006. George Boole. Encyclopedia of Philosophy. 2nd edition. Detroit: Macmillan Reference USA, 2006 BOOLE, GEORGE (1815-1864), English mathematician and logician, is regarded by many logicians
More informationMAT 4040: Senior Capstone Today: Intro & Controversy in Equations
MAT 4040: Senior Capstone Today: Intro & Controversy in Equations Think of an equation that is important or interesting. Write down: The equation or its name Why you choose this equation What it is trying
More informationSupplementary Course Notes: Continuous vs. Discrete (Analog vs. Digital) Representation of Information
Supplementary Course Notes: Continuous vs. Discrete (Analog vs. Digital) Representation of Information Introduction to Engineering in Medicine and Biology ECEN 1001 Richard Mihran In the first supplementary
More informationRoute optimization using Hungarian method combined with Dijkstra's in home health care services
Research Journal of Computer and Information Technology Sciences ISSN 2320 6527 Route optimization using Hungarian method combined with Dijkstra's method in home health care services Abstract Monika Sharma
More informationChapter 4: How Universal Are Turing Machines? CS105: Great Insights in Computer Science
Chapter 4: How Universal Are Turing Machines? CS105: Great Insights in Computer Science QuickSort quicksort(list): - if len of list
More information1/ 19 2/17 3/23 4/23 5/18 Total/100. Please do not write in the spaces above.
1/ 19 2/17 3/23 4/23 5/18 Total/100 Please do not write in the spaces above. Directions: You have 50 minutes in which to complete this exam. Please make sure that you read through this entire exam before
More informationSenior Math Studies Lesson Planning Date Lesson Events
Senior Math Studies Lesson Planning 2014-2015 Date Lesson Events Aug 25 Style of Class: Student-led work teams (SLWTs) Facilitated (as opposed to taught) by the teacher Considering MS topics what areas
More informationBroadcast Networks with Arbitrary Channel Bit Rates
1 Time Slicing in Mobile TV Broadcast Networks with Arbitrary Channel Bit Rates Cheng-Hsin Hsu Joint work with Mohamed Hefeeda Simon Fraser University, Canada April 23, 2009 Outline 2 Motivation Problem
More informationIntroduction: A Musico-Logical Offering
Chapter 3 Introduction: A Musico-Logical Offering Normal is a Distribution Unknown 3.1 Introduction to the Introduction As we have finally reached the beginning of the book proper, these notes should mirror
More informationPower-Driven Flip-Flop p Merging and Relocation. Shao-Huan Wang Yu-Yi Liang Tien-Yu Kuo Wai-Kei Tsing Hua University
Power-Driven Flip-Flop p Merging g and Relocation Shao-Huan Wang Yu-Yi Liang Tien-Yu Kuo Wai-Kei Mak @National Tsing Hua University Outline Introduction Problem Formulation Algorithms Experimental Results
More informationcse371/mat371 LOGIC Professor Anita Wasilewska
cse371/mat371 LOGIC Professor Anita Wasilewska LECTURE 1 LOGICS FOR COMPUTER SCIENCE: CLASSICAL and NON-CLASSICAL CHAPTER 1 Paradoxes and Puzzles Chapter 1 Introduction: Paradoxes and Puzzles PART 1: Logic
More informationDesign for Testability Part II
Design for Testability Part II 1 Partial-Scan Definition A subset of flip-flops is scanned. Objectives: Minimize area overhead and scan sequence length, yet achieve required fault coverage. Exclude selected
More informationAlgorithms, Lecture 3 on NP : Nondeterministic Polynomial Time
Algorithms, Lecture 3 on NP : Nondeterministic Polynomial Time Last week: Defined Polynomial Time Reductions: Problem X is poly time reducible to Y X P Y if can solve X using poly computation and a poly
More informationCSC 373: Algorithm Design and Analysis Lecture 17
CSC 373: Algorithm Design and Analysis Lecture 17 Allan Borodin March 4, 2013 Some materials are from Keven Wayne s slides and MIT Open Courseware spring 2011 course at http://tinyurl.com/bjde5o5. 1 /
More informationUsing Scan Side Channel to Detect IP Theft
Using Scan Side Channel to Detect IP Theft Leonid Azriel, Ran Ginosar, Avi Mendelson Technion Israel Institute of Technology Shay Gueron, University of Haifa and Intel Israel 1 Outline IP theft issue in
More information6.034 Notes: Section 4.1
6.034 Notes: Section 4.1 Slide 4.1.1 What is a logic? A logic is a formal language. And what does that mean? It has a syntax and a semantics, and a way of manipulating expressions in the language. We'll
More informationBOOK REVIEW. William W. Davis
BOOK REVIEW William W. Davis Douglas R. Hofstadter: Codel, Escher, Bach: an Eternal Golden Braid. Pp. xxl + 777. New York: Basic Books, Inc., Publishers, 1979. Hardcover, $10.50. This is, principle something
More informationI Don t Want to Think About it Now: Decision Theory With Costly Computation
I Don t Want to Think About it Now: Decision Theory With Costly Computation Joseph Y. Halpern Cornell University halpern@cs.cornell.edu Rafael Pass Cornell University rafael@cs.cornell.edu Abstract Computation
More informationNorth Shore Community College
North Shore Community College Course Number: IEL217 Section: MAL Course Name: Digital Electronics 1 Semester: Credit: 4 Hours: Three hours of Lecture, Two hours Laboratory per week Thursdays 8:00am (See
More informationMATH 214 (NOTES) Math 214 Al Nosedal. Department of Mathematics Indiana University of Pennsylvania. MATH 214 (NOTES) p. 1/11
MATH 214 (NOTES) Math 214 Al Nosedal Department of Mathematics Indiana University of Pennsylvania MATH 214 (NOTES) p. 1/11 CHAPTER 6 CONTINUOUS PROBABILITY DISTRIBUTIONS MATH 214 (NOTES) p. 2/11 Simple
More informationDIMACS Implementation Challenges 1 Network Flows and Matching, Clique, Coloring, and Satisability, Parallel Computing on Trees and
8th DIMACS Implementation Challenge: The Traveling Salesman Problem http://wwwresearchattcom/dsj/chtsp/ David S Johnson AT&T Labs { Research Florham Park, NJ 07932-0971 dsj@researchattcom http://wwwresearchattcom/dsj/
More informationCurry s Formalism as Structuralism
Curry s Formalism as Structuralism Jonathan P. Seldin Department of Mathematics and Computer Science University of Lethbridge Lethbridge, Alberta, Canada jonathan.seldin@uleth.ca http://www.cs.uleth.ca/
More informationConclusion. 1) From the point of view of the Sudoku addict, the most striking results should be the following.
Conclusion What has been achieved In this conclusion, I d like first to highlight a few facets of what has been achieved in this book, from four complementary overlapping points of view. 1) From the point
More informationPartitioning a Proof: An Exploratory Study on Undergraduates Comprehension of Proofs
Partitioning a Proof: An Exploratory Study on Undergraduates Comprehension of Proofs Eyob Demeke David Earls California State University, Los Angeles University of New Hampshire In this paper, we explore
More informationStandard L A T E X Report
Standard L A T E X Report The Author Institution or Address The Date Abstract This is the text of the abstract. Abstracts give a short synopsis of the report, noting the major points developed in the course
More informationFull-custom design of split-set data weighted averaging with output register for jitter suppression
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Full-custom design of split-set data weighted averaging with output register for jitter suppression To cite this article: M C
More informationChapter 5 Synchronous Sequential Logic
Chapter 5 Synchronous Sequential Logic Chih-Tsun Huang ( 黃稚存 ) http://nthucad.cs.nthu.edu.tw/~cthuang/ Department of Computer Science National Tsing Hua University Outline Introduction Storage Elements:
More informationAskDrCallahan Calculus 1 Teacher s Guide
AskDrCallahan Calculus 1 Teacher s Guide 3rd Edition rev 080108 Dale Callahan, Ph.D., P.E. Lea Callahan, MSEE, P.E. Copyright 2008, AskDrCallahan, LLC v3-r080108 www.askdrcallahan.com 2 Welcome to AskDrCallahan
More informationPermutations of the Octagon: An Aesthetic-Mathematical Dialectic
Proceedings of Bridges 2015: Mathematics, Music, Art, Architecture, Culture Permutations of the Octagon: An Aesthetic-Mathematical Dialectic James Mai School of Art / Campus Box 5620 Illinois State University
More informationTOWARDS A BEHAVIORAL PSYCHOLOGY OF MATHEMATICAL THINKING
BEHAVIORAr~ PSYCHOLOGY OF MA'l'HEMATICAL THINKING 227 TOWARDS A BEHAVIORAL PSYCHOLOGY OF MATHEMATICAL THINKING Patrick Suppes Some fundamental concepts that stand uncertainly on the border of mathematics,
More informationThe Aristotle Index: Measuring Complexity in the Twenty-First Century. John N. Warfield
The Aristotle Index: Measuring Complexity in the Twenty-First Century John N. Warfield As is well-known, Aristotle introduced inference into the history of human thought through the syllogism: a three-statement
More informationFPGA Design. Part I - Hardware Components. Thomas Lenzi
FPGA Design Part I - Hardware Components Thomas Lenzi Approach We believe that having knowledge of the hardware components that compose an FPGA allow for better firmware design. Being able to visualise
More informationRetiming Sequential Circuits for Low Power
Retiming Sequential Circuits for Low Power José Monteiro, Srinivas Devadas Department of EECS MIT, Cambridge, MA Abhijit Ghosh Mitsubishi Electric Research Laboratories Sunnyvale, CA Abstract Switching
More informationCPM Schedule Summarizing Function of the Beeline Diagramming Method
CPM Schedule Summarizing Function of the Beeline Diagramming Method Seon-Gyoo Kim Professor, Department of Architectural Engineering, Kangwon National University, Korea Abstract The schedule hierarchy
More informationIntroduction p. 1 The Elements of an Argument p. 1 Deduction and Induction p. 5 Deductive Argument Forms p. 7 Truth and Validity p. 8 Soundness p.
Preface p. xi Introduction p. 1 The Elements of an Argument p. 1 Deduction and Induction p. 5 Deductive Argument Forms p. 7 Truth and Validity p. 8 Soundness p. 11 Consistency p. 12 Consistency and Validity
More informationChapter 1 Overview of Music Theories
Chapter 1 Overview of Music Theories The title of this chapter states Music Theories in the plural and not the singular Music Theory or Theory of Music. Probably no single theory will ever cover the enormous
More informationAristotle. Aristotle. Aristotle and Plato. Background. Aristotle and Plato. Aristotle and Plato
Aristotle Aristotle Lived 384-323 BC. He was a student of Plato. Was the tutor of Alexander the Great. Founded his own school: The Lyceum. He wrote treatises on physics, cosmology, biology, psychology,
More informationECE 301 Digital Electronics
ECE 301 Digital Electronics Derivation of Flip-Flop Input Equations and State Assignment (Lecture #24) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,
More informationCambridge Introductions to Philosophy new textbooks from cambridge
Cambridge Introductions to Philosophy new textbooks from cambridge See the back page for details on how to order your free inspection copy www.cambridge.org/cip An Introduction to Political Philosophy
More informationdata and is used in digital networks and storage devices. CRC s are easy to implement in binary
Introduction Cyclic redundancy check (CRC) is an error detecting code designed to detect changes in transmitted data and is used in digital networks and storage devices. CRC s are easy to implement in
More informationScrambling and Descrambling SMT-LIB Benchmarks
Scrambling and Descrambling SMT-LIB Benchmarks Tjark Weber Uppsala University, Sweden SMT 2016 Coimbra, Portugal Tjark Weber Scrambling and Descrambling... 1 / 16 Motivation The benchmarks used in the
More informationG.709 FEC testing Guaranteeing correct FEC behavior
Technical Note G.709 FEC testing Guaranteeing correct FEC behavior Capabilities and Benefits Techniques in Detail Example The ONT-503/506/5 optical network tester from JDSU which delivers in-depth analysis
More informationECE 4220 Real Time Embedded Systems Final Project Spectrum Analyzer
ECE 4220 Real Time Embedded Systems Final Project Spectrum Analyzer by: Matt Mazzola 12222670 Abstract The design of a spectrum analyzer on an embedded device is presented. The device achieves minimum
More informationChapter 12. Synchronous Circuits. Contents
Chapter 12 Synchronous Circuits Contents 12.1 Syntactic definition........................ 149 12.2 Timing analysis: the canonic form............... 151 12.2.1 Canonic form of a synchronous circuit..............
More informationChapter I: The MU Puzzle
Chapter 5 Chapter I: The MU Puzzle Has the dog Buddha-nature? MU! Zen Koan 5.1 Abstract A simple formal system (the MIU-system) is presented, and the rader is urged to work out a puzzle to gain familiarity
More informationFoundations in Data Semantics. Chapter 4
Foundations in Data Semantics Chapter 4 1 Introduction IT is inherently incapable of the analog processing the human brain is capable of. Why? Digital structures consisting of 1s and 0s Rule-based system
More informationEnhancing Performance in Multiple Execution Unit Architecture using Tomasulo Algorithm
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 6.017 IJCSMC,
More informationFig. I.1 The Fields Medal.
INTRODUCTION The world described by the natural and the physical sciences is a concrete and perceptible one: in the first approximation through the senses, and in the second approximation through their
More informationDIFFERENTIATE SOMETHING AT THE VERY BEGINNING THE COURSE I'LL ADD YOU QUESTIONS USING THEM. BUT PARTICULAR QUESTIONS AS YOU'LL SEE
1 MATH 16A LECTURE. OCTOBER 28, 2008. PROFESSOR: SO LET ME START WITH SOMETHING I'M SURE YOU ALL WANT TO HEAR ABOUT WHICH IS THE MIDTERM. THE NEXT MIDTERM. IT'S COMING UP, NOT THIS WEEK BUT THE NEXT WEEK.
More informationFrom Theory to Practice: Private Circuit and Its Ambush
Indian Institute of Technology Kharagpur Telecom ParisTech From Theory to Practice: Private Circuit and Its Ambush Debapriya Basu Roy, Shivam Bhasin, Sylvain Guilley, Jean-Luc Danger and Debdeep Mukhopadhyay
More informationA Transaction-Oriented UVM-based Library for Verification of Analog Behavior
A Transaction-Oriented UVM-based Library for Verification of Analog Behavior IEEE ASP-DAC 2014 Alexander W. Rath 1 Agenda Introduction Idea of Analog Transactions Constraint Random Analog Stimulus Monitoring
More informationMathematics Curriculum Document for Algebra 2
Unit Title: Square Root Functions Time Frame: 6 blocks Grading Period: 2 Unit Number: 4 Curriculum Enduring Understandings (Big Ideas): Representing relationships mathematically helps us to make predictions
More informationAchieving Faster Time to Tapeout with In-Design, Signoff-Quality Metal Fill
White Paper Achieving Faster Time to Tapeout with In-Design, Signoff-Quality Metal Fill May 2009 Author David Pemberton- Smith Implementation Group, Synopsys, Inc. Executive Summary Many semiconductor
More informationInformatique Fondamentale IMA S8
Informatique Fondamentale IMA S8 Cours 1 - Intro + schedule + finite state machines Laure Gonnord http://laure.gonnord.org/pro/teaching/ Laure.Gonnord@polytech-lille.fr Université Lille 1 - Polytech Lille
More informationHigh Performance Microprocessor Design and Automation: Overview, Challenges and Opportunities IBM Corporation
High Performance Microprocessor Design and Automation: Overview, Challenges and Opportunities Introduction About Myself What to expect out of this lecture Understand the current trend in the IC Design
More informationThe PeRIPLO Propositional Interpolator
The PeRIPLO Propositional Interpolator N. Sharygina Formal Verification and Security Group University of Lugano joint work with Leo Alt, Antti Hyvarinen, Grisha Fedyukovich and Simone Rollini October 2,
More informationQuine s Two Dogmas of Empiricism. By Spencer Livingstone
Quine s Two Dogmas of Empiricism By Spencer Livingstone An Empiricist? Quine is actually an empiricist Goal of the paper not to refute empiricism through refuting its dogmas Rather, to cleanse empiricism
More informationOntology as a formal one. The language of ontology as the ontology itself: the zero-level language
Ontology as a formal one The language of ontology as the ontology itself: the zero-level language Vasil Penchev Bulgarian Academy of Sciences: Institute for the Study of Societies and Knowledge: Dept of
More informationFPGA Hardware Resource Specific Optimal Design for FIR Filters
International Journal of Computer Engineering and Information Technology VOL. 8, NO. 11, November 2016, 203 207 Available online at: www.ijceit.org E-ISSN 2412-8856 (Online) FPGA Hardware Resource Specific
More informationNCPC 2007 Problem A: Phone List 3. Problem A. Phone List
NCPC 2007 Problem A: Phone List 3 Problem A Phone List Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let s say the phone catalogue listed
More informationSense and soundness of thought as a biochemical process Mahmoud A. Mansour
Sense and soundness of thought as a biochemical process Mahmoud A. Mansour August 17,2015 Abstract A biochemical model is suggested for how the mind/brain might be modelling objects of thought in analogy
More informationDomains of Inquiry (An Instrumental Model) and the Theory of Evolution. American Scientific Affiliation, 21 July, 2012
Domains of Inquiry (An Instrumental Model) and the Theory of Evolution 1 American Scientific Affiliation, 21 July, 2012 1 What is science? Why? How certain can we be of scientific theories? Why do so many
More informationPCIe: EYE DIAGRAM ANALYSIS IN HYPERLYNX
PCIe: EYE DIAGRAM ANALYSIS IN HYPERLYNX w w w. m e n t o r. c o m PCIe: Eye Diagram Analysis in HyperLynx PCI Express Tutorial This PCI Express tutorial will walk you through time-domain eye diagram analysis
More informationAREA OF KNOWLEDGE: MATHEMATICS
AREA OF KNOWLEDGE: MATHEMATICS Introduction Mathematics: the rational mind is at work. When most abstracted from the world, mathematics stands apart from other areas of knowledge, concerned only with its
More informationCredibility and the Continuing Struggle to Find Truth. We consume a great amount of information in our day-to-day lives, whether it is
1 Tonka Lulgjuraj Lulgjuraj Professor Hugh Culik English 1190 10 October 2012 Credibility and the Continuing Struggle to Find Truth We consume a great amount of information in our day-to-day lives, whether
More informationEncryption. Secure Chat. Encryption Machine
Encryption Introduction to Programming in Java: An Interdisciplinary Approach Robert Sedgewick and Kevin Wayne Copy right 2002 2010 19 Feb 2012 19:24:23 Secure Chat Encryption Machine Alice wants to send
More informationLOGIC AND RISK AS QUALITATIVE AND QUANTITATIVE DIMENSIONS OF DECISION-MAKING PROCESS
O P E R A T I O N S R E S E A R C H A N D D E C I S I O N S No. 3 2016 DOI: 10.5277/ord160302 Tadeusz GALANC 1 Wiktor KOŁWZAN 2 Jerzy PIERONEK 3 Agnieszka SKOWRONEK-GRĄDZIEL 2 LOGIC AND RISK AS QUALITATIVE
More informationHYBRID CONCATENATED CONVOLUTIONAL CODES FOR DEEP SPACE MISSION
HYBRID CONCATENATED CONVOLUTIONAL CODES FOR DEEP SPACE MISSION Presented by Dr.DEEPAK MISHRA OSPD/ODCG/SNPA Objective :To find out suitable channel codec for future deep space mission. Outline: Interleaver
More informationRAPID SOC PROOF-OF-CONCEPT FOR ZERO COST JEFF MILLER, PRODUCT MARKETING AND STRATEGY, MENTOR GRAPHICS PHIL BURR, SENIOR PRODUCT MANAGER, ARM
RAPID SOC PROOF-OF-CONCEPT FOR ZERO COST JEFF MILLER, PRODUCT MARKETING AND STRATEGY, MENTOR GRAPHICS PHIL BURR, SENIOR PRODUCT MANAGER, ARM A M S D E S I G N & V E R I F I C A T I O N W H I T E P A P
More informationFor an alphabet, we can make do with just { s, 0, 1 }, in which for typographic simplicity, s stands for the blank space.
Problem 1 (A&B 1.1): =================== We get to specify a few things here that are left unstated to begin with. I assume that numbers refers to nonnegative integers. I assume that the input is guaranteed
More informationCPS311 Lecture: Sequential Circuits
CPS311 Lecture: Sequential Circuits Last revised August 4, 2015 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce
More informationHow to Predict the Output of a Hardware Random Number Generator
How to Predict the Output of a Hardware Random Number Generator Markus Dichtl Siemens AG, Corporate Technology Markus.Dichtl@siemens.com Abstract. A hardware random number generator was described at CHES
More information1/8. Axioms of Intuition
1/8 Axioms of Intuition Kant now turns to working out in detail the schematization of the categories, demonstrating how this supplies us with the principles that govern experience. Prior to doing so he
More informationPredicting the immediate future with Recurrent Neural Networks: Pre-training and Applications
Predicting the immediate future with Recurrent Neural Networks: Pre-training and Applications Introduction Brandon Richardson December 16, 2011 Research preformed from the last 5 years has shown that the
More informationBasic Information for MAT194F Calculus Engineering Science 2013
Basic Information for MAT194F Calculus Engineering Science 2013 1. Your Lecturers P.C. Stangeby Institute for Aerospace Studies To arrange a meeting, please email: pcs@starfire.utias.utoronto.ca D. Penneys
More informationCS/MA 109 Quantitative Reasoning. Wayne Snyder Computer Science Department Boston University
CS/MA 109 Quantitative Reasoning Wayne Snyder Department Boston University Today Recursion and self-reference: a scientific and culture exploration Next: Cryptography Soon: Artificial Intelligence and
More informationFundamentals of DSP Chap. 1: Introduction
Fundamentals of DSP Chap. 1: Introduction Chia-Wen Lin Dept. CSIE, National Chung Cheng Univ. Chiayi, Taiwan Office: 511 Phone: #33120 Digital Signal Processing Signal Processing is to study how to represent,
More informationCOE328 Course Outline. Fall 2007
COE28 Course Outline Fall 2007 1 Objectives This course covers the basics of digital logic circuits and design. Through the basic understanding of Boolean algebra and number systems it introduces the student
More informationNew Address Shift Linear Feedback Shift Register Generator
New Address Shift Linear Feedback Shift Register Generator Kholood J. Moulood Department of Mathematical, Tikrit University, College of Education for Women, Salahdin. E-mail: khmsc2006@yahoo.com. Abstract
More informationMATH 195: Gödel, Escher, and Bach (Spring 2001) Notes and Study Questions for Tuesday, March 20
MATH 195: Gödel, Escher, and Bach (Spring 2001) Notes and Study Questions for Tuesday, March 20 Reading: Chapter VII Typographical Number Theory (pp.204 213; to Translation Puzzles) We ll also talk a bit
More information1 Lesson 11: Antiderivatives of Elementary Functions
1 Lesson 11: Antiderivatives of Elementary Functions Chapter 6 Material: pages 237-252 in the textbook: The material in this lesson covers The definition of the antiderivative of a function of one variable.
More informationChapter 3: Sequential Logic
Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005 www.idc.ac.il/tecs Chapter 3: Sequential Logic Usage and Copyright Notice: Copyright 2005 Noam Nisan and Shimon Schocken This presentation
More informationUnawareness and Strategic Announcements in Games with Uncertainty
Unawareness and Strategic Announcements in Games with Uncertainty Erkut Y. Ozbay February 19, 2008 Abstract This paper studies games with uncertainty where players have different awareness regarding a
More informationOPERATIONS SEQUENCING IN A CABLE ASSEMBLY SHOP
OPERATIONS SEQUENCING IN A CABLE ASSEMBLY SHOP Ahmet N. Ceranoglu* 1, Ekrem Duman*, M. Hamdi Ozcelik**, * Dogus University, Dept. of Ind. Eng., Acibadem, Istanbul, Turkey ** Yapi Kredi Bankasi, Dept. of
More informationWhat Do Mathematicians Do?
What Do Mathematicians Do? By Professor A J Berrick Department of Mathematics National University of Singapore Note: This article was first published in the October 1999 issue of the Science Research Newsletter.
More informationIntroduction Section 1: Logic. The basic purpose is to learn some elementary logic.
1 Introduction About this course I hope that this course to be a practical one where you learn to read and write proofs yourselves. I will not present too much technical materials. The lecture pdf will
More informationLossless Compression Algorithms for Direct- Write Lithography Systems
Lossless Compression Algorithms for Direct- Write Lithography Systems Hsin-I Liu Video and Image Processing Lab Department of Electrical Engineering and Computer Science University of California at Berkeley
More informationMid Term Papers. Fall 2009 (Session 02) CS101. (Group is not responsible for any solved content)
Fall 2009 (Session 02) CS101 (Group is not responsible for any solved content) Subscribe to VU SMS Alert Service To Join Simply send following detail to bilal.zaheem@gmail.com Full Name Master Program
More information