Dynamics and Computation
|
|
- Elfrieda Lyons
- 5 years ago
- Views:
Transcription
1 1 Dynamics and Computation Olivier Bournez Ecole Polytechnique Laboratoire d Informatique de l X Palaiseau, France Dynamics And Computation
2 1 Dynamics and Computation over R Olivier Bournez Ecole Polytechnique Laboratoire d Informatique de l X Palaiseau, France Dynamics And Computation
3 1 Dynamics and Computation over R d Olivier Bournez Ecole Polytechnique Laboratoire d Informatique de l X Palaiseau, France Dynamics And Computation
4 1 Dynamics and Computation over R d Several View Points Olivier Bournez Ecole Polytechnique Laboratoire d Informatique de l X Palaiseau, France Dynamics And Computation
5 2 Menu Introduction Some Very Basic Models Recursive Analysis The General Purpose Analog Computer (GPAC) of C. Shannon
6 3 Sub-menu Introduction A question Motivation 1: Models of Computation Motivation 2: Effectivity in Analysis Motivation 3: Algebraic Complexity Motivation 4: Verification/Control
7 Consider you preferred function f : R R. 4
8 4 Consider you preferred function f : R R. Is f computable?
9 4 Consider you preferred function f : R R. Is f computable? Several notions of computability for real functions
10 4 Consider you preferred function f : R R. Is f computable? Several notions of computability for real functions Turing machine approach: Recursive Analysis.
11 4 Consider you preferred function f : R R. Is f computable? Several notions of computability for real functions Turing machine approach: Recursive Analysis. Continuous time analog models
12 4 Consider you preferred function f : R R. Is f computable? Several notions of computability for real functions Turing machine approach: Recursive Analysis. Continuous time analog models Blum Shub Smale machines
13 4 Consider you preferred function f : R R. Is f computable? Several notions of computability for real functions Turing machine approach: Recursive Analysis. Continuous time analog models Blum Shub Smale machines...
14 4 Consider you preferred function f : R R. Is f computable? Several notions of computability for real functions with various motivations:
15 4 Consider you preferred function f : R R. Is f computable? Several notions of computability for real functions with various motivations: computability theory
16 4 Consider you preferred function f : R R. Is f computable? Several notions of computability for real functions with various motivations: computability theory lower bounds / upper bounds
17 4 Consider you preferred function f : R R. Is f computable? Several notions of computability for real functions with various motivations: computability theory lower bounds / upper bounds verification control theory
18 4 Consider you preferred function f : R R. Is f computable? Several notions of computability for real functions with various motivations: computability theory lower bounds / upper bounds verification control theory...
19 5 Sub-menu Introduction A question Motivation 1: Models of Computation Motivation 2: Effectivity in Analysis Motivation 3: Algebraic Complexity Motivation 4: Verification/Control
20 6 Motivation 1: Models of Computation NACA Lewis Flight Propulsion Laboratory s Differential Analyser Question: What is the computational power of this machine?
21 7 Sub-menu Introduction A question Motivation 1: Models of Computation Motivation 2: Effectivity in Analysis Motivation 3: Algebraic Complexity Motivation 4: Verification/Control
22 8 Motivation 2: Effectivity in Analysis Question: Can we compute the maximum of a continuous function over a compact domain? A point on which it is maximal?
23 9 Sub-menu Introduction A question Motivation 1: Models of Computation Motivation 2: Effectivity in Analysis Motivation 3: Algebraic Complexity Motivation 4: Verification/Control
24 10 Motivation 3: Algebraic Complexity Question: What is the complexity of Newton s method?
25 11 Sub-menu Introduction A question Motivation 1: Models of Computation Motivation 2: Effectivity in Analysis Motivation 3: Algebraic Complexity Motivation 4: Verification/Control
26 12 Motivation 4: Verification/Control Model M made of a mixture of continuous/discrete parts. Specification φ (e.g. reachability property). Informal question: Can we avoid that? Formal question: M = φ?
27 13 Menu Introduction Some Very Basic Models Recursive Analysis The General Purpose Analog Computer (GPAC) of C. Shannon
28 Some Very Basic Models Dynamical Systems Turing Machines Sub-menu
29 Dynamical Systems over a continuous space H = (X, f ) Discrete-Time { y(t + 1) = f (y(t)) y(0) = x Continuous-Time { y = f (y(t)) y(0) = x
30 Some Very Basic Models Dynamical Systems Turing Machines Sub-menu
31 17 Turing machines Particular discrete-time dynamical systems. Elementary operations 1. move some head on working tape one position to the left or right 2. move some head on input tape or output tape right 3. write a symbol a Σ on the position under the head 4. compare the symbol under some head with the symbol a Σ
32 18 Menu Introduction Some Very Basic Models Recursive Analysis The General Purpose Analog Computer (GPAC) of C. Shannon
33 Sub-menu Recursive Analysis Computable Reals Computable Functions Over the Real Numbers Complexity
34 The Starting Point of Recursive Analysis The computable numbers may be described briefly as the real numbers whose expressions as a decimal are calculable by a finite means. Cited from A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42 (1936) This part is mostly borrowed from Vasko Brattka s Tutorial, CIE
35 21 The Field of Computable Real Numbers Definition A real number is computable if there exists a Turing machine (without input) which can produce its decimal expansion. Theorem (Rice54) The set R c of computable reals is a real algebraically closed field. The field R c contains all particular real numbers we ever met in analysis (e.g. 2, π, e, etc.). Q A R c R (A denotes the set of algebraic numbers). R c is countable. R c is not complete. In the Russian school (ex. Markov, Sanin, Kushner, Aberth) on focus on computability of functions f : R c R c.
36 Characterisations of computable real numbers Theorem Let x [0, 1]. The following are equivalent x is a computable real number. there exists a computable sequence of rational numbers (q n ) n N which converges rapidly to x, i.e q i x < 2 i. {q Q : q < x} is a recursive set. there exists a recursive set A N such that x = i A 2 i 1. x admits a computable continued fraction expansion, i.e. there is some computable f : N N such that x = 1 f (0) + 1 f (1)+ 1 f (2)+ 1 f (3)+.
37 23 We sketch the proof of {q Q : q < x} is a recursive set iff (q n ) n N with q i x < 2 i.. For each i determine some q i Q with q i < x and not q i + 2 i 1 < x. These properties are decidable and a suitable i always exists. It follows that q i < x q i + 2 i 1 and thus q i x < 2 i.. 1. Case x Q. It is easy to decide q < x for a given q Q. 2. Case x Q. For given q Q, we determine some i N such that q i x < 2 i and q i q > 2 i. Such an i exists because x Q. Then q < x iff q < q i, which is decidable. Remark: the proof of contains a non-constructive case distinction that cannot be removed!!
38 Sub-menu Recursive Analysis Computable Reals Computable Functions Over the Real Numbers Complexity
39 25 Recursive Analysis: Naive Idea Due to Turing, Grzegorczyk, Lacombe. Here presentation from Weihrauch. A tape represents a real number Each real number x is represented via its decimal representation M behaves like a Turing Machine Read-only one-way input tapes Write-only one-way output tape. M outputs a representation of f (x 1, x 2 ) from representations of x 1, x 2.
40 Theorem The function f : R R, x 3x is not computable with respect to the decimal representation. Main problem: distinguishing 1/3 = 0.3 ω from 0.3.
41 Recursive Analysis Due to Turing, Grzegorczyk, Lacombe. Here presentation from Weihrauch. A tape represents a real number Each real number x is represented via an infinite sequence (x n ) n Q, x n x 2 n. M behaves like a Turing Machine Read-only one-way input tapes Write-only one-way output tape. M outputs a representation of f (x 1, x 2 ) from representations of x 1, x 2.
42 Computable Reals A sequence (x n ) n Q of rationals is a ρ-name of a real number x if there exists three functions a, b, c from N to N such that for all n N, x n = ( 1) a(n) b(n) c(n) + 1, and x n x 2 n.
43 Computable Reals A sequence (x n ) n Q of rationals is a ρ-name of a real number x if there exists three functions a, b, c from N to N such that for all n N, x n = ( 1) a(n) b(n) c(n) + 1, and x n x 2 n. x R is computable if it has a computable ρ-name: i.e. if we can take a, b, and c computable.
44 Computable Reals A sequence (x n ) n Q of rationals is a ρ-name of a real number x if there exists three functions a, b, c from N to N such that for all n N, x n = ( 1) a(n) b(n) c(n) + 1, and x n x 2 n. x R is computable if it has a computable ρ-name: i.e. if we can take a, b, and c computable. A function f : R R is computable, if for all x, a Turing machine taking a ρ-name of x, produces a ρ-name of f (x).
45 Computable Reals A sequence (x n ) n Q of rationals is a ρ-name of a real number x if there exists three functions a, b, c from N to N such that for all n N, x n = ( 1) a(n) b(n) c(n) + 1, and x n x 2 n. x R is computable if it has a computable ρ-name: i.e. if we can take a, b, and c computable. A function f : R R is computable, if for all x, a Turing machine taking a ρ-name of x, produces a ρ-name of f (x). There are Turing machines M a,b,c a, M a,b,c b and M a,b,c c that computes a, b and c representing f (x) from representations of x.
46 29 Computable functions Theorem The following functions are computable The arithmetic operations +,,., : R R R. The absolute value function abs : R R, x x. The functions min, max : R R R. The constant functions R R, x c with c R c. The projections pr i : R n R, (x 1,, x n ) x i. All polynomials p : R n R with computable coefficients. The exponential function and the trigonometric functions exp, sin, cos : R R. The square root function and the logarithm function log on their natural domains.
47 Some Results Theorem If f : R R is computable then f : R R is continuous Some results: IVT: There is no general algorithm that determines the 0 of a continuous function f : [0, 1] R with f (0)f (1) < 0. Brower FPT: There exists some computable f : [0, 1] 2 [0, 1] 2 without computable fix point [Orevkov63]. There exists a computable f : [0, 1] R of class C 1, whose derivative is not computable [Myhill71]. There exists some computable f : [0, 1] [ 1, 1] R such that y = f (t, y), has no computable solution over any closed domain [PE-R79].
48 Sub-menu Recursive Analysis Computable Reals Computable Functions Over the Real Numbers Complexity
49 Complexity This is possible to define a notion of polynomial time computable real number and of polynomial time computable function [Ko91]
50 Complexity This is possible to define a notion of polynomial time computable real number and of polynomial time computable function [Ko91] One must change the representation (signed digit representation). x = ρ(a n a n 1 a 0.a 1 a 2 ) = n a i 2 i, i=1 where a i { 1, 0, 1}, and n 1 (with the additional property that a n 0, if n 0, and a n a n 1 {1 1, 11}, if nge1).
51 Complexity This is possible to define a notion of polynomial time computable real number and of polynomial time computable function [Ko91] One must change the representation (signed digit representation). x = ρ(a n a n 1 a 0.a 1 a 2 ) = n a i 2 i, i=1 where a i { 1, 0, 1}, and n 1 (with the additional property that a n 0, if n 0, and a n a n 1 {1 1, 11}, if nge1). In constrast to the binary representation, the signed digit represenation is redundant in a symmetric way.
52 Complexity This is possible to define a notion of polynomial time computable real number and of polynomial time computable function [Ko91] One must change the representation (signed digit representation). x = ρ(a n a n 1 a 0.a 1 a 2 ) = n a i 2 i, i=1 where a i { 1, 0, 1}, and n 1 (with the additional property that a n 0, if n 0, and a n a n 1 {1 1, 11}, if nge1). In constrast to the binary representation, the signed digit represenation is redundant in a symmetric way. The idea is that one requires that bit number n must be produced in time p(n) for some fixed polynomial p.
53 33 Some results Theorem (Friedman84) P = NP iff for all function f : [0, 1] R polynomial time computable, the maximum function g : [0, 1] R defined by g(x) = max{f (y) : 0 y x} for all x [0, 1] is polynomial time computable. Theorem (Ko83) P = PSPACE implies that for all function f : [0, 1] [ 1, 1] R that satisfies some Lipschitz condition f (x, z 1 ) f (x, z 2 ) L z 1 z 2 for L > 0, the unique solution y : [0, 1] R of ordinary differential equation y = f (x, y(x)), y(0) = 0 is polynomial time computable.
54 Numerical Problems vs Complexity Rough classification [Ko91] Numerical Problem Optimisation (functions) Ordinary Differential Equations Integration Optimisation (numbers) Roots (dim 1) Differentiation Complexity Class EXPSPACE-complete PSPACE-complete #P-complete NP-complete P-complete P (if computable) From slides of V. Brattka 34
55 35 Futher Readings Vasko Brattka, Computability and Complexity in Analysis, CIE 2005 Tutorial, online. Klaus Weihrauch, Computability and Complexity in Analysis, Springer, Ker-I Ko, Complexity Theory of Real Functions, Birkhäuser, Marian Pour-El and J. Ian Richards, Computability in Analysis and Physics, Springer 1989.
56 36 Menu Introduction Some Very Basic Models Recursive Analysis The General Purpose Analog Computer (GPAC) of C. Shannon
57 The General Purpose Analog Computer The GPAC A mathematical abstraction from Claude Shannon (1941) of the Differential Analyzers.
58 Sub-menu The General Purpose Analog Computer (GPAC) of C. Shannon Differential Analysers The GPAC Model
59 Differential analyzers Vannevar Bush s 1938 mechanical Differential Analyser Underlying principles: Lord Kelvin First ever built: V. Bush 1931 at MIT. Applications: from gunfire control up to aircraft design Intensively used during U.S. war effort. Electronic versions from late 40s, used until 70s
60 40 A Mechanical Integrator Bureau of Naval Personnel, Basic Machines and How They Work, 1964
61 A Differential Analyser in Mecano Douglas Rayner Hartree, 1933 Tim Robinson,
62 Electronic Differential Analyzer Advertisements in Scientific American, March 1953.
63 Electronic Differential Analyzer Advertisements in Scientific American, March See also: Doug Coward s Analog Computer Museum
64 43 A Modern Electronic Integrator R C U - + V V (t) = 1/RC t 0 U(t)dt
65 Sub-menu The General Purpose Analog Computer (GPAC) of C. Shannon Differential Analysers The GPAC Model
66 Basic units of a GPAC A GPAC is a machine built using basic units k k A constant unit u v + u + v An adder unit u v { w (t) = u(t)v (t) w w(t 0 ) = α An integrator unit u v uv A multiplier unit Feedback connections are allowed. A function is GPAC-generated if it corresponds to the output of some unit of a GPAC.
67 Example: Generating cos and sin via a GPAC t -1 y 1 y 2 y 3 y 1 = y 3 & y 1 (0) = 1 y 2 = y 1 & y 2 (0) = 0 y 3 = y 2 & y 3 (0) = 0 y 1 = cos(t), y 2 = sin(t), y 3 = sin(t).
68 About Shannon s 41 paper Shannon s 41 characterization is incomplete. several problems about definitions, corrected by [PourEl-Richards74], [Lipshitz-Rubel87], [Graça-Costa03].
69 About Shannon s 41 paper Shannon s 41 characterization is incomplete. several problems about definitions, corrected by [PourEl-Richards74], [Lipshitz-Rubel87], [Graça-Costa03]. In short Shannon assumes that considered circuits have an output and that this output is unique. The result relating the GPAC with d.a. functions has a gap.
70 About Shannon s 41 paper Shannon s 41 characterization is incomplete. several problems about definitions, corrected by [PourEl-Richards74], [Lipshitz-Rubel87], [Graça-Costa03]. In short Shannon assumes that considered circuits have an output and that this output is unique. The result relating the GPAC with d.a. functions has a gap. 1 Figure 1: A circuit that admits no solutions as outputs y + i t Figure 2: A circuit that admits two distinct solutions as outputs.
71 48 Question How computability with GPAC compare to classical computability?
Analyse récursive vue avec des fonctions réelles récursives
1/30 Analyse récursive vue avec des fonctions réelles récursives Emmanuel Hainry LORIA/INPL, Nancy, France 24 janvier 2007 2/30 Discrete Case There are several models for computation over integers Recursive
More informationPolynomial differential equations compute all real computable functions on computable compact intervals
Polynomial differential equations compute all real computable functions on computable compact intervals Olivier Bournez Inria Lorraine, France & LORIA, 54506 Vandœuvre-Lès-Nancy, France Manuel L. Campagnolo
More informationA note on parallel and alternating time
Journal of Complexity 23 (2007) 594 602 www.elsevier.com/locate/jco A note on parallel and alternating time Felipe Cucker a,,1, Irénée Briquel b a Department of Mathematics, City University of Hong Kong,
More informationThe physical Church Turing thesis and non-deterministic computation over the real numbers
370, 3349 3358 doi:10.1098/rsta.2011.0322 The physical Church Turing thesis and non-deterministic computation over the real numbers BY GILLES DOWEK* INRIA, 23 avenue d Italie, CS 81321, 75214 Paris Cedex
More informationReal Numbers and Computational Complexity
Real Numbers and Computational Complexity Norbert Müller mueller@uni-trier.de FB IV Informatik Universität Trier Norbert Müller (Trier) Darmstadt, 2012-10-05 1 / 34 Introduction 1 Introduction 2 Computational
More informationBounded Model Checking with SAT/SMT. Edmund M. Clarke School of Computer Science Carnegie Mellon University 1/39
Bounded Model Checking with SAT/SMT Edmund M. Clarke School of Computer Science Carnegie Mellon University 1/39 Recap: Symbolic Model Checking with BDDs Method used by most industrial strength model checkers:
More informationDRAFT. Algebraic computation models. Chapter 14
Chapter 14 Algebraic computation models Somewhat rough We think of numerical algorithms root-finding, gaussian elimination etc. as operating over R or C, even though the underlying representation of the
More informationRigorous numerical computation of polynomial differential equations over unbounded domains
Rigorous numerical computation of polynomial differential equations over unbounded domains Olivier Bournez 1, Daniel S. Graça 2,3, Amaury Pouly 1,2 1 Ecole Polytechnique, LIX, 91128 Palaiseau Cedex, France
More informationRobust computation with dynamical systems
Robust computation with dynamical systems Olivier Bournez 1 Daniel S. Graça 2 Emmanuel Hainry 3 1 École Polytechnique, LIX, Palaiseau, France 2 DM/FCT, Universidade do Algarve, Faro & SQIG/Instituto de
More informationA truly universal ordinary differential equation
1 / 21 A truly universal ordinary differential equation Amaury Pouly 1 Joint work with Olivier Bournez 2 1 Max Planck Institute for Software Systems, Germany 2 LIX, École Polytechnique, France 11 May 2018
More informationLecture 21: Algebraic Computation Models
princeton university cos 522: computational complexity Lecture 21: Algebraic Computation Models Lecturer: Sanjeev Arora Scribe:Loukas Georgiadis We think of numerical algorithms root-finding, gaussian
More informationReal Interactive Proofs for VPSPACE
Brandenburgische Technische Universität, Cottbus-Senftenberg, Germany Colloquium Logicum Hamburg, September 2016 joint work with M. Baartse 1. Introduction Blum-Shub-Smale model of computability and complexity
More informationIntroduction to Turing Machines
Introduction to Turing Machines Deepak D Souza Department of Computer Science and Automation Indian Institute of Science, Bangalore. 12 November 2015 Outline 1 Turing Machines 2 Formal definitions 3 Computability
More informationReducibility in polynomialtime computable analysis. Akitoshi Kawamura (U Tokyo) Wadern, Germany, September 24, 2015
Reducibility in polynomialtime computable analysis Akitoshi Kawamura (U Tokyo) Wadern, Germany, September 24, 2015 Computable Analysis Applying computability / complexity theory to problems involving real
More informationVALIANT S MODEL AND THE COST OF COMPUTING INTEGERS
comput. complex. 13 (2004), 131 146 1016-3328/04/030131 16 DOI 10.1007/s00037-004-0186-2 c Birkhäuser Verlag, Basel 2004 computational complexity VALIANT S MODEL AND THE COST OF COMPUTING INTEGERS Pascal
More informationPre-Calculus and Trigonometry Capacity Matrix
Review Polynomials A1.1.4 A1.2.5 Add, subtract, multiply and simplify polynomials and rational expressions Solve polynomial equations and equations involving rational expressions Review Chapter 1 and their
More informationBoundedness of the domain of definition is undecidable for polynomial ODEs
Boundedness of the domain of definition is undecidable for polynomial ODEs Daniel S. Graça DM/FCT, University of Algarve, C. Gambelas, 8005-139 Faro, Portugal and SQIG/IT Lisbon, Portugal Jorge Buescu
More information6-1 Computational Complexity
6-1 Computational Complexity 6. Computational Complexity Computational models Turing Machines Time complexity Non-determinism, witnesses, and short proofs. Complexity classes: P, NP, conp Polynomial-time
More informationFP//LINSPACE computability of Riemann zeta function ζ(s) in Ko Friedman model
FP//LINSPACE computability of Riemann zeta function ζ(s) in Ko Friedman model Sergey V. Yakhontov arxiv:408.2362v4 [cs.cc] 6 Nov 204 Abstract In the present paper, we construct an algorithm for the evaluation
More informationAxiomatizing Analog Algorithms
Axiomatizing Analog Algorithms Olivier Bournez 1, Nachum Dershowitz 2, and Pierre Néron 3 1 Laboratoire d Informatique de l X (LIX), École Polytechnique, France 2 School of Computer Science, Tel Aviv University,
More informationEECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of
More informationComputational complexity
COMS11700 Computational complexity Department of Computer Science, University of Bristol Bristol, UK 2 May 2014 COMS11700: Computational complexity Slide 1/23 Introduction If we can prove that a language
More informationδ-approximable Functions
δ-approximable Functions Charles Meyssonnier 1, Paolo Boldi 2, and Sebastiano Vigna 2 1 École Normale Supérieure de Lyon, France 2 Dipartimento di Scienze dell Informazione, Università degli Studi di Milano,
More informationPolynomial-time hierarchy of computable reals. Author. Published. Journal Title. Copyright Statement. Downloaded from. Link to published version
Polynomial-time hierarchy of computable reals Author Chen, Qingliang, Su, Kaile, Wu, Lijun Published 011 Journal Title Journal of Computational Information Systems Copyright Statement 011 Binary Information
More informationElementarily Computable Functions Over the Real Numbers and R-Sub-Recursive Functions
Elementarily Computable Functions Over the Real Numbers and R-Sub-Recursive Functions Olivier Bournez and Emmanuel Hainry LORIA/INRIA, 615 Rue du Jardin Botanique, BP101 54602 Villers lès Nancy, France
More informationOutline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) January 30, 2003 John Wawrzynek Outline Review of three representations for combinational logic:
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 14, 2014 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More informationLecture 5: Introduction to Complexity Theory
Lecture 5: Introduction to Complexity Theory 1 Complexity Theory 1.1 Resource Consumption Complexity theory, or more precisely, Computational Complexity theory, deals with the resources required during
More informationHandbook of Logic and Proof Techniques for Computer Science
Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives
More informationINFORMATIQUE THÉORIQUE ET APPLICATIONS
INFORMATIQUE THÉORIQUE ET APPLICATIONS JACOBO TORÁN On the complexity of computable real sequences Informatique théorique et applications, tome 21, n o 2 (1987), p. 175-180
More informationAlgebraic Characterizations of Complexity-Theoretic Classes of Real Functions
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions Olivier Bournez, Walid Gomaa, Emmanuel Hainry To cite this version: Olivier Bournez, Walid Gomaa, Emmanuel Hainry. Algebraic
More informationLecture 3 (Notes) 1. The book Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak;
Topics in Theoretical Computer Science March 7, 2016 Lecturer: Ola Svensson Lecture 3 (Notes) Scribes: Ola Svensson Disclaimer: These notes were written for the lecturer only and may contain inconsistent
More informationNP-Completeness. Algorithmique Fall semester 2011/12
NP-Completeness Algorithmique Fall semester 2011/12 1 What is an Algorithm? We haven t really answered this question in this course. Informally, an algorithm is a step-by-step procedure for computing a
More informationPolynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length Olivier Bournez École Polytechnique, LIX, 928 Palaiseau Cedex, France Daniel Graça FCT, Universidade
More informationAlmost transparent short proofs for NP R
Brandenburgische Technische Universität, Cottbus, Germany From Dynamics to Complexity: A conference celebrating the work of Mike Shub Toronto, May 10, 2012 Supported by DFG under GZ:ME 1424/7-1 Outline
More informationComputability and Complexity Theory: An Introduction
Computability and Complexity Theory: An Introduction meena@imsc.res.in http://www.imsc.res.in/ meena IMI-IISc, 20 July 2006 p. 1 Understanding Computation Kinds of questions we seek answers to: Is a given
More information258 Handbook of Discrete and Combinatorial Mathematics
258 Handbook of Discrete and Combinatorial Mathematics 16.3 COMPUTABILITY Most of the material presented here is presented in far more detail in the texts of Rogers [R], Odifreddi [O], and Soare [S]. In
More informationCounterexamples to witness conjectures. Notations Let E be the set of admissible constant expressions built up from Z; + ;?;;/; exp and log. Here a co
Counterexamples to witness conjectures Joris van der Hoeven D pt. de Math matiques (b t. 45) Universit Paris-Sud 91405 Orsay CEDEX France August 15, 003 Consider the class of exp-log constants, which is
More informationExponential and logarithm functions
ucsc supplementary notes ams/econ 11a Exponential and logarithm functions c 2010 Yonatan Katznelson The material in this supplement is assumed to be mostly review material. If you have never studied exponential
More informationXI. Computational Complexity
XI. Computational Complexity Yuxi Fu BASICS, Shanghai Jiao Tong University Mathematic proofs, like computations, are energy consuming business. There are mathematical theorems, and computational tasks,
More informationMeasures of relative complexity
Measures of relative complexity George Barmpalias Institute of Software Chinese Academy of Sciences and Visiting Fellow at the Isaac Newton Institute for the Mathematical Sciences Newton Institute, January
More informationThe Polynomial Hierarchy
The Polynomial Hierarchy Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas Ahto.Buldas@ut.ee Motivation..synthesizing circuits is exceedingly difficulty. It is even
More informationA Network Model of Analogue Computation over Metric Algebras
A Network Model of Analogue Computation over Metric Algebras J.V. Tucker 1 and J.I. Zucker 2, 1 Department of Computer Science, University of Wales Swansea, Singleton Park, Swansea, SA2 8PP, UK J.V.Tucker@swansea.ac.uk
More informationEECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive
EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational
More information1 Randomized complexity
80240233: Complexity of Computation Lecture 6 ITCS, Tsinghua Univesity, Fall 2007 23 October 2007 Instructor: Elad Verbin Notes by: Zhang Zhiqiang and Yu Wei 1 Randomized complexity So far our notion of
More informationCSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010
CSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010 So far our notion of realistic computation has been completely deterministic: The Turing Machine
More informationPolynomial Time Computation. Topics in Logic and Complexity Handout 2. Nondeterministic Polynomial Time. Succinct Certificates.
1 2 Topics in Logic and Complexity Handout 2 Anuj Dawar MPhil Advanced Computer Science, Lent 2010 Polynomial Time Computation P = TIME(n k ) k=1 The class of languages decidable in polynomial time. The
More informationContinuous time models are equivalent to Turing machines.
Continuous time models are equivalent to Turing machines. A characterization of P and NP with ordinary differential equations. Olivier Bournez 1, Daniel S. Graça 2,3, and Amaury Pouly 1,2 1 Ecole Polytechnique,
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 18, 2012 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More informationLecture 4 : Quest for Structure in Counting Problems
CS6840: Advanced Complexity Theory Jan 10, 2012 Lecture 4 : Quest for Structure in Counting Problems Lecturer: Jayalal Sarma M.N. Scribe: Dinesh K. Theme: Between P and PSPACE. Lecture Plan:Counting problems
More informationTime to learn about NP-completeness!
Time to learn about NP-completeness! Harvey Mudd College March 19, 2007 Languages A language is a set of strings Examples The language of strings of all zeros with odd length The language of strings with
More informationSOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO /4
SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO. 2 2003/4 1 SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL
More informationComputable Functions
Computable Functions Part I: Non Computable Functions Computable and Partially Computable Functions Computable Function Exists a Turing Machine M -- M Halts on All Input -- M(x) = f (x) Partially Computable
More informationOutline. Complexity Theory. Example. Sketch of a log-space TM for palindromes. Log-space computations. Example VU , SS 2018
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 3. Logarithmic Space Reinhard Pichler Institute of Logic and Computation DBAI Group TU Wien 3. Logarithmic Space 3.1 Computational
More informationMACHINE COMPUTING. the limitations
MACHINE COMPUTING the limitations human computing stealing brain cycles of the masses word recognition: to digitize all printed writing language education: to translate web content games with a purpose
More informationRon Paul Curriculum Mathematics 8 Lesson List
Ron Paul Curriculum Mathematics 8 Lesson List 1 Introduction 2 Algebraic Addition 3 Algebraic Subtraction 4 Algebraic Multiplication 5 Week 1 Review 6 Algebraic Division 7 Powers and Exponents 8 Order
More informationThe P-vs-NP problem. Andrés E. Caicedo. September 10, 2011
The P-vs-NP problem Andrés E. Caicedo September 10, 2011 This note is based on lecture notes for the Caltech course Math 6c, prepared with A. Kechris and M. Shulman. 1 Decision problems Consider a finite
More informationHamiltonian Systems as Machines Over the Reals
AMS Proceedings Style Volume 00, 0000 Hamiltonian Systems as Machines Over the Reals Jeremy Schiff Abstract. I explain how to associate computations with physical systems such as finite degree of freedom
More informationElementarily computable functions over the real numbers and
Theoretical Computer Science 348 (2005) 130 147 www.elsevier.com/locate/tcs Elementarily computable functions over the real numbers and R-sub-recursive functions Olivier Bournez a,, Emmanuel Hainry b a
More informationNotational conventions
CHAPTER 0 Notational conventions We now specify some of the notations and conventions used throughout this book. We make use of some notions from discrete mathematics such as strings, sets, functions,
More informationUndecidability COMS Ashley Montanaro 4 April Department of Computer Science, University of Bristol Bristol, UK
COMS11700 Undecidability Department of Computer Science, University of Bristol Bristol, UK 4 April 2014 COMS11700: Undecidability Slide 1/29 Decidability We are particularly interested in Turing machines
More informationMiller Objectives Alignment Math
Miller Objectives Alignment Math 1050 1 College Algebra Course Objectives Spring Semester 2016 1. Use algebraic methods to solve a variety of problems involving exponential, logarithmic, polynomial, and
More informationAdvanced topic: Space complexity
Advanced topic: Space complexity CSCI 3130 Formal Languages and Automata Theory Siu On CHAN Chinese University of Hong Kong Fall 2016 1/28 Review: time complexity We have looked at how long it takes to
More informationCS4026 Formal Models of Computation
CS4026 Formal Models of Computation Turing Machines Turing Machines Abstract but accurate model of computers Proposed by Alan Turing in 1936 There weren t computers back then! Turing s motivation: find
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationCalculus. Central role in much of modern science Physics, especially kinematics and electrodynamics Economics, engineering, medicine, chemistry, etc.
Calculus Calculus - the study of change, as related to functions Formally co-developed around the 1660 s by Newton and Leibniz Two main branches - differential and integral Central role in much of modern
More informationarxiv:cs/ v1 [cs.cc] 16 Aug 2006
On Polynomial Time Computable Numbers arxiv:cs/0608067v [cs.cc] 6 Aug 2006 Matsui, Tetsushi Abstract It will be shown that the polynomial time computable numbers form a field, and especially an algebraically
More informationAdvanced Mathematics Unit 2 Limits and Continuity
Advanced Mathematics 3208 Unit 2 Limits and Continuity NEED TO KNOW Expanding Expanding Expand the following: A) (a + b) 2 B) (a + b) 3 C) (a + b)4 Pascals Triangle: D) (x + 2) 4 E) (2x -3) 5 Random Factoring
More informationAdvanced Mathematics Unit 2 Limits and Continuity
Advanced Mathematics 3208 Unit 2 Limits and Continuity NEED TO KNOW Expanding Expanding Expand the following: A) (a + b) 2 B) (a + b) 3 C) (a + b)4 Pascals Triangle: D) (x + 2) 4 E) (2x -3) 5 Random Factoring
More informationAverage Case Complexity
Average Case Complexity A fundamental question in NP-completeness theory is When, and in what sense, can an NP-complete problem be considered solvable in practice? In real life a problem often arises with
More informationA Survey on Continuous Time Computations
A Survey on Continuous Time Computations Olivier Bournez 1,2 and Manuel L. Campagnolo 3,4 1 INRIA Lorraine, 2 LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy2-UHP), Campus scientifique, BP 239, 54506 Vandœuvre-Lès-Nancy,
More informationON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM. Turing 1936
ON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM Turing 1936 Where are We? Ignoramus et ignorabimus Wir mussen wissen Wir werden wissen We do not know We shall not know We must know
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTATION
FORMAL LANGUAGES, AUTOMATA AND COMPUTATION DECIDABILITY ( LECTURE 15) SLIDES FOR 15-453 SPRING 2011 1 / 34 TURING MACHINES-SYNOPSIS The most general model of computation Computations of a TM are described
More informationLimits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes
Limits at Infinity If a function f has a domain that is unbounded, that is, one of the endpoints of its domain is ±, we can determine the long term behavior of the function using a it at infinity. Definition
More informationOn NP-Completeness for Linear Machines
JOURNAL OF COMPLEXITY 13, 259 271 (1997) ARTICLE NO. CM970444 On NP-Completeness for Linear Machines Christine Gaßner* Institut für Mathematik und Informatik, Ernst-Moritz-Arndt-Universität, F.-L.-Jahn-Strasse
More informationTuring Machines. Lecture 8
Turing Machines Lecture 8 1 Course Trajectory We will see algorithms, what can be done. But what cannot be done? 2 Computation Problem: To compute a function F that maps each input (a string) to an output
More informationA Survey of Partial-Observation Stochastic Parity Games
Noname manuscript No. (will be inserted by the editor) A Survey of Partial-Observation Stochastic Parity Games Krishnendu Chatterjee Laurent Doyen Thomas A. Henzinger the date of receipt and acceptance
More informationOverview of Topics. Finite Model Theory. Finite Model Theory. Connections to Database Theory. Qing Wang
Overview of Topics Finite Model Theory Part 1: Introduction 1 What is finite model theory? 2 Connections to some areas in CS Qing Wang qing.wang@anu.edu.au Database theory Complexity theory 3 Basic definitions
More informationPlanning and Optimization
Planning and Optimization B6. Computational Complexity of Planning: Results Malte Helmert and Gabriele Röger Universität Basel October 20, 2016 (Bounded-Cost) Plan Existence The Propositional Planning
More informationExpansions with P = NP. Christine Gaßner Greifswald
Expansions with P = NP Greifswald Expansions with P = NP 1. 2. The complexity classes P Σ, NP Σ, DEC Σ 3. Why is it difficult to find an R with P ΣR = NP ΣR? 4. How to construct a relation R such that
More informationOn the Halting Problem of Finite-State Programs
On the Halting Problem of Finite-State Programs Raimund Kirner Vienna University of Technology, Austria, raimund@vmars.tuwien.ac.at Abstract. The undecidability of the halting problem is a well-known research
More informationParallelism and Machine Models
Parallelism and Machine Models Andrew D Smith University of New Brunswick, Fredericton Faculty of Computer Science Overview Part 1: The Parallel Computation Thesis Part 2: Parallelism of Arithmetic RAMs
More informationWeek 2: Defining Computation
Computational Complexity Theory Summer HSSP 2018 Week 2: Defining Computation Dylan Hendrickson MIT Educational Studies Program 2.1 Turing Machines Turing machines provide a simple, clearly defined way
More informationA Simple Proof of P versus NP
A Simple Proof of P versus NP Frank Vega To cite this version: Frank Vega. A Simple Proof of P versus NP. 2016. HAL Id: hal-01281254 https://hal.archives-ouvertes.fr/hal-01281254 Submitted
More informationNonlinear Real Arithmetic and δ-satisfiability. Paolo Zuliani
Nonlinear Real Arithmetic and δ-satisfiability Paolo Zuliani School of Computing Science Newcastle University, UK (Slides courtesy of Sicun Gao, UCSD) 1 / 27 Introduction We use hybrid systems for modelling
More informationA universal ordinary differential equation
1 / 10 A universal ordinary differenial equaion Olivier Bournez 1, Amaury Pouly 2 1 LIX, École Polyechnique, France 2 Max Planck Insiue for Sofware Sysems, Germany 12 july 2017 2 / 10 Universal differenial
More informationKolmogorov complexity
Kolmogorov complexity In this section we study how we can define the amount of information in a bitstring. Consider the following strings: 00000000000000000000000000000000000 0000000000000000000000000000000000000000
More informationCSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides
CSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides First Person: Second Person: Family Name: Family Name: Given Name: Given
More informationa = a i 2 i a = All such series are automatically convergent with respect to the standard norm, but note that this representation is not unique: i<0
p-adic Numbers K. Sutner v0.4 1 Modular Arithmetic rings integral domains integers gcd, extended Euclidean algorithm factorization modular numbers add Lemma 1.1 (Chinese Remainder Theorem) Let a b. Then
More informationPart I: Definitions and Properties
Turing Machines Part I: Definitions and Properties Finite State Automata Deterministic Automata (DFSA) M = {Q, Σ, δ, q 0, F} -- Σ = Symbols -- Q = States -- q 0 = Initial State -- F = Accepting States
More informationA statistical mechanical interpretation of algorithmic information theory
A statistical mechanical interpretation of algorithmic information theory Kohtaro Tadaki Research and Development Initiative, Chuo University 1 13 27 Kasuga, Bunkyo-ku, Tokyo 112-8551, Japan. E-mail: tadaki@kc.chuo-u.ac.jp
More informationA General Testability Theory: Classes, properties, complexity, and testing reductions
A General Testability Theory: Classes, properties, complexity, and testing reductions presenting joint work with Luis Llana and Pablo Rabanal Universidad Complutense de Madrid PROMETIDOS-CM WINTER SCHOOL
More informationCS 125 Section #10 (Un)decidability and Probability November 1, 2016
CS 125 Section #10 (Un)decidability and Probability November 1, 2016 1 Countability Recall that a set S is countable (either finite or countably infinite) if and only if there exists a surjective mapping
More informationCOMPUTER ARITHMETIC. 13/05/2010 cryptography - math background pp. 1 / 162
COMPUTER ARITHMETIC 13/05/2010 cryptography - math background pp. 1 / 162 RECALL OF COMPUTER ARITHMETIC computers implement some types of arithmetic for instance, addition, subtratction, multiplication
More informationNon-Approximability Results (2 nd part) 1/19
Non-Approximability Results (2 nd part) 1/19 Summary - The PCP theorem - Application: Non-approximability of MAXIMUM 3-SAT 2/19 Non deterministic TM - A TM where it is possible to associate more than one
More informationjflap demo Regular expressions Pumping lemma Turing Machines Sections 12.4 and 12.5 in the text
On the menu today jflap demo Regular expressions Pumping lemma Turing Machines Sections 12.4 and 12.5 in the text 1 jflap Demo jflap: Useful tool for creating and testing abstract machines Finite automata,
More informationClassical transcendental curves
Classical transcendental curves Reinhard Schultz May, 2008 In his writings on coordinate geometry, Descartes emphasized that he was only willing to work with curves that could be defined by algebraic equations.
More informationAlgebra II/Math III Curriculum Map
6 weeks Unit Unit Focus Common Core Math Standards 1 Simplify and perform operations with one variable involving rational, exponential and quadratic functions. 2 Graph and evaluate functions to solve problems.
More informationComplexity Theory 112. Space Complexity
Complexity Theory 112 Space Complexity We ve already seen the definition SPACE(f(n)): the languages accepted by a machine which uses O(f(n)) tape cells on inputs of length n. Counting only work space NSPACE(f(n))
More informationFibonacci, Kronecker and Hilbert NKS Klaus Sutner Carnegie Mellon University sutner
Fibonacci, Kronecker and Hilbert NKS 2007 Klaus Sutner Carnegie Mellon University www.cs.cmu.edu/ sutner NKS 07 1 Overview Fibonacci, Kronecker and Hilbert??? Logic and Decidability Additive Cellular Automata
More information