Real Numbers and Computational Complexity

Size: px
Start display at page:

Download "Real Numbers and Computational Complexity"

Transcription

1 Real Numbers and Computational Complexity Norbert Müller FB IV Informatik Universität Trier Norbert Müller (Trier) Darmstadt, / 34

2 Introduction 1 Introduction 2 Computational complexity / efficient algorithms 3 Real vs. discrete computational complexity Norbert Müller (Trier) Darmstadt, / 34

3 Introduction Double precision: numbers as basic objects... generalization to R: BSS model (Blum/Shub/Smale): algebraic approach restricted to basic arithmetic comparison like as total functions ERA, exact real arithmetic: approach is algebraic and analytic starting from basic arithmetic comparison like as partial functions extendable via (restricted) operator for limits ERA is already implemented, BSS will remain a theoretical model uniform cost measure not realistic complexity connected to: long integers (Karatsuba, Toom/Cook, Schönhage/Str., Fürer) multiple precision floating point numbers (Brent) Norbert Müller (Trier) Darmstadt, / 34

4 Introduction Example for ERA: Solving differential equations Exact trajectory x 1 = ẋ 2 x 2 = ẋ 1 t 0 = 0 x 0 = (1, 0) data structures for real numbers / sequences / functions... operators for Taylor sum, IVP solving... (t i, x i ) (a n,i ) n N := IVP(t i, x i ) f i := λt. a n,i t n x i+1 := f i (t i+1 ) Norbert Müller (Trier) Darmstadt, / 34

5 Introduction (theoretical) computer science computable analysis / complexity on the reals constructive mathematics numerical mathematics TTE: Type-2 theory of effectivity (Weihrauch, Brattka, Hertling, Ko, Rettinger, Ziegler, M.,...) domains (Blanck, Edalat, Escardo, Tucker,...) BSS-Modell Real RAM (Blum, Shub, Smale, Meer, Gassner...) Norbert Müller (Trier) Darmstadt, / 34

6 Introduction Models of computation for functions f : S S for non-countable S: S 1 = Σ Type-2-Turing machine infinite input tape, output tape write-once, infinite computations prefix of the output is determined by prefix of the input S 2 = [Σ Σ ] oracle Turing machine M with functions as oracles fixing oracle Φ S2, M Φ computes Γ(Φ) S 2 : input output { oracle Φ S 2 }} { [ }{{} Σ }{{} Σ ] queries answers Γ(Φ) S 2 { }} { [ }{{} Σ ] }{{} Σ ] input output machine queries answers oracle Norbert Müller (Trier) Darmstadt, / 34

7 Introduction From Σ to R using Type-2-Turing machines: use e.g. infinite decimal strings w for input and output w 1 = w 2 = w 3 = better: signed digits { 9, 8, 7,..., 1, 0, 1,..., 8, 9} alternatively use sequences w of finite decimals with delimiter w 4 = 1#1.4#1.41#1.414#1.4142#... Generalization for metric spaces (M, d): use a countable dense subset D in M and encode fast converging Cauchy sequences in D... Norbert Müller (Trier) Darmstadt, / 34

8 Introduction From S 2 = [Σ Σ ] to R using oracle Turing machines: interpret S = [Σ Σ ] as [N Q]: Φ S Γ(Φ) S { }} { { }} { [ }{{} N queries Q }{{} answers ] [ }{{} N input Q }{{} output ] i.e. Φ is a sequence (q n ) n N and Γ(Φ) is a sequence (q n ) n N n N n N f x q n Q q n Q a real function f is computed as follows: if x R is given by (qn ) n N with ( n) x q n 2 n then (q n ) must satisfy ( n) f (x) q n 2 n Norbert Müller (Trier) Darmstadt, / 34

9 Introduction Computable analysis (via representations ): R ϱ f 1 f 2 R ϱ R ϱ Q N Γ Q N 1 Γ Q N 2 Remember: Computable functions are continuous! Norbert Müller (Trier) Darmstadt, / 34

10 Computational complexity / efficient algorithms 1 Introduction 2 Computational complexity / efficient algorithms 3 Real vs. discrete computational complexity Norbert Müller (Trier) Darmstadt, / 34

11 Computational complexity / efficient algorithms Computational complexity t G (n) on a (compact) set G: Type-2-machines M: worst case (on strings w for x G) t G (n) = for the number of steps of M until the output is determined up to a precision 2 n oracle Turing { machines M: worst case (on all oracles Φ for a x G) t G (n) = for the number of steps of M for input n Results (almost) independent of machine model! addition, subtraction: computable in linear time multiplication: computable in time M(n) := n log(n)2 θ(log (n)) Norbert Müller (Trier) Darmstadt, / 34

12 Computational complexity / efficient algorithms division, rational functions, x q (with q Q): (using fix point algorithms...) sin(x), cos(x), e x : (using Taylor series) O(M(n)) O(M(n) n/ log n) π, e, ln(2), sin(x), cos(x), ln(x), e x,...: O(M(n) log n) (using arithmetic/geometric mean a = a+b 2 ; b = a b ) Norbert Müller (Trier) Darmstadt, / 34

13 Computational complexity / efficient algorithms important aspect: modulus of computation, lookahead, delay to determine output with precision n, we need to know input with precision d(n) Example: substitution of functions g and f : t g f (n) = O( t g (n) + t f (d g (n)) ) d g f (n) = d f (d g (n)) f with Lipschitz constant L delay d f (n) n + log 2 L possible Norbert Müller (Trier) Darmstadt, / 34

14 Computational complexity / efficient algorithms A complexity bound t : N N is called regular, if eventually t is monotonic increasing with then: t is at least linear: id O(t) 2 t(n) t(2n) β t(n) t is polynomially bounded: k t O(n k ) important closure properties: linear increase: sparse sums: t(c n) O(t) log 2 n k=0 t(2 k ) O(t) Norbert Müller (Trier) Darmstadt, / 34

15 Computational complexity / efficient algorithms example: t(n) = n α (log n) β (log log n) γ for arbitrary α 1, β, γ 0, α, β, γ R are regular! bounds now implicitly regular (hence polynomial)! Norbert Müller (Trier) Darmstadt, / 34

16 Computational complexity / efficient algorithms Important application: computation of fixpoints given f with fixpoint ξ = f (ξ) use iteration x i+1 f (x i ) starting in some x 0 lim x i = ξ if f appropriate f(x) Norbert Müller (Trier) Darmstadt, / 34

17 Computational complexity / efficient algorithms Case (1), f converges linear to ξ with L < 1 ξ x i L ξ x i 1 L i ξ x 0 To get x i with precision 2 n, we have i n/ log 2 (1/L) complexity n t f (i + c) i=1 ξ has complexity O(n t f (n)) f(x) Norbert Müller (Trier) Darmstadt, / 34

18 Computational complexity / efficient algorithms Case (2), f converges superlinear to ξ with α > 1: ξ x i L ξ x i 1 α c ξ x 0 α 2i To get x i with precision 2 n, we have i log α n complexity ξ has complexity O(t f (n)) log α n i=1 t f (α i + c) f(x) Norbert Müller (Trier) Darmstadt, / 34

19 Computational complexity / efficient algorithms Applications: f (x) = 2 x + a x 2 mit ξ = 1 a division is in O(M) mit ξ = a square root is in O(M) f (x) = x + a/x 2 Norbert Müller (Trier) Darmstadt, / 34

20 Computational complexity / efficient algorithms Application: Differentiation suppose f twice continuously differentiable f f (x + h) f (x) (x) h = f (x) f (ξ) = f (θ) (x ξ) f (θ) h choose h 2 2n f has complexity O(t f (n)). Norbert Müller (Trier) Darmstadt, / 34

21 Computational complexity / efficient algorithms Applications: inverse function, f f 1 (if f (x) 0 on interval [a, b] ): f 1 (a) is fixpoint of x f (x) a f (x) f 1 has complexity O(t f (n)) root finding, f ξ, f (ξ) = 0 (with simple root ξ) ξ = f 1 (0) root ξ has complexity O(t f (n)) numerical integration, f f f holomorphic on intervall [a, b] integral x a f (y)dy has complexity O(n2 t f (n)) Norbert Müller (Trier) Darmstadt, / 34

22 Real vs. discrete computational complexity 1 Introduction 2 Computational complexity / efficient algorithms 3 Real vs. discrete computational complexity Norbert Müller (Trier) Darmstadt, / 34

23 Real vs. discrete computational complexity Consider functionals like derivative : (f, x) f (x) integral : (f, x, y) y x f (t)dt maximum : (f, x, y) max{f (t) x t y} maxarg : (f, x, y) z with f (z) = maximum(f, x, y)} or operators like derive : f f integrate : f (y integral(f, 0, y)) maximize : f (y maximum(f, 0, y)) solve : f u with u (x) = f (x, u(x)), u(0) = 0 Norbert Müller (Trier) Darmstadt, / 34

24 Real vs. discrete computational complexity [Ko et al.]: non-uniform negative results like (grossly shortened...) f P+C[0, 1] with derive(f )(q) not computable for all q Q P = NP iff maximize(f ) is in P+C[0, 1] for all f P+C[0, 1] #P = FP iff integrate(f ) is in P+C[0, 1] for all f P+C[0, 1] P = PSPACE iff solve(f ) is in P+C[0, 1] for all f P+C[[0, 1] [ 1, 1]] Norbert Müller (Trier) Darmstadt, / 34

25 Consider Real vs. discrete computational complexity g a (x) = e 1 x(x 1) g b (x) = x 0 e 1 y(y 1) dy g a, g b P+C [0, 1] and for all i > 0 g (i) a g a (0) = g a (1) = g b (0) = 0 g b (1) > 0 (0) = g (i) a (1) = g (i) b (0) = g(i) b (1) = 0 Norbert Müller (Trier) Darmstadt, / 34

26 Real vs. discrete computational complexity Every computable ξ R is root of a strictly monotonic f P+C. in general: complexity of f does not tell anything about complexity of ξ! Norbert Müller (Trier) Darmstadt, / 34

27 Real vs. discrete computational complexity P = NP max 0 y 1 f (y) polytime for any f P+C...v v v v v v1w v f L (...v0u) = c 1 (v) + c 2 (v) 1 2 g a(u) f L (...v1wu) = c 1 (v) + c 2 (v) g a (u), if w is a witness for v L f L (...v1wu) = c 1 (v), if w is not a witness for v L Norbert Müller (Trier) Darmstadt, / 34

28 Real vs. discrete computational complexity x 0 FP = #P f (y)dy polytime for any f P+C...v v v v v1w v f L (...v1wu) = c 1 (v) + c 2 (v) g a (u), if w is a witness for v L f L (...v1wu) = c 1 (v), if w is a witness for v L Norbert Müller (Trier) Darmstadt, / 34

29 Real vs. discrete computational complexity [M. et al]: non-uniform positive results like Let f be holomorphic on compact G and computable in polynomial time t(n) then derive(f ) is computable in time t(n) integrate(f ) is computable in time n 2 t(n) solve(f ) is computable in time n 2 t(n 2 ) Norbert Müller (Trier) Darmstadt, / 34

30 Real vs. discrete computational complexity suppose f holomorphic, f (x) = a k x k f is completely determined by arbitrary infinite set of values basic operators: f (a k ) and (a k ) f map polytime argumtents to polytime results for many real operators Φ the complexity of Φ(f ) is comparable to f s complexity! integration, differentiation, differential equations... via formal operations on coeffizients Norbert Müller (Trier) Darmstadt, / 34

31 Real vs. discrete computational complexity standard TTE approach for definition of complexity: use a metric/norm on functions spaces, (e.g. for C[0, 1]) use some dense subset D, (e.g. rational polygons, rational polynomials, box lists...) represent functions as limits of sequences in D ( f = lim p n for polygons/polynomials/boxes (p n ) n N ) usual condition for speed of convergence: f p n 2 n approximations are valid everywhere, but time complexity is exponential sqrt(x) 3-bit, 50 boxes bit, 200 boxes Norbert Müller (Trier) Darmstadt, / 34

32 Real vs. discrete computational complexity usual applications only need local approximations to functions! new computational model: Instead of n p n for approximating f with use (x, n) p n (x) with f p n 2 n (i.e. p n is a complete list of boxes f ) f (x) p n (x) 2 n (i.e. just one single box ) idea e.g. used in: Zhao/M. [CCA 2008]: Complexity of operators on compact sets M. [CCA 2009]: Enhancing imperative exact real arithmetic... Kawamura/Cook [STOC 2010]: Complexity theory for operators in analysis Norbert Müller (Trier) Darmstadt, / 34

33 Real vs. discrete computational complexity Kawamura/Cook: real functions as argument/result of an operator Γ: Φ 1,2 S { }} { [ (Q N) N }{{} Q }{{} ] queries/input answers/output Φ1 : (Q N) Q approximating values: f (q) Φ 1 (q, n) 2 n Φ 2 : N Q bounding the global modulus: x y Φ 2 (n) f (x) f (y) 2 n (q, n ) Q N n N (q, n) Q N n N form of results (here shortened and without explanation...): solve is FPSPACE 2-2 mf -complete Γ f Φ 1 (n, q ) Q Φ 2 (n ) Q Φ 1(n, q) Q Φ 2(n) Q until now: no definition for finer distinctions (eg. linear complexity) Norbert Müller (Trier) Darmstadt, / 34

34 Real vs. discrete computational complexity Thank you for your attention! Any questions or remarks? Norbert Müller (Trier) Darmstadt, / 34

Reducibility 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 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 information

δ-approximable Functions

δ-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 information

Dynamics and Computation

Dynamics and Computation 1 Dynamics and Computation Olivier Bournez Ecole Polytechnique Laboratoire d Informatique de l X Palaiseau, France Dynamics And Computation 1 Dynamics and Computation over R Olivier Bournez Ecole Polytechnique

More information

Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011

Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Section 2.6 (cont.) Properties of Real Functions Here we first study properties of functions from R to R, making use of the additional structure

More information

8.5 Taylor Polynomials and Taylor Series

8.5 Taylor Polynomials and Taylor Series 8.5. TAYLOR POLYNOMIALS AND TAYLOR SERIES 50 8.5 Taylor Polynomials and Taylor Series Motivating Questions In this section, we strive to understand the ideas generated by the following important questions:

More information

Notes for Lecture 3... x 4

Notes 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 information

Lecture 4 : Quest for Structure in Counting Problems

Lecture 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 information

Lecture 21: Algebraic Computation Models

Lecture 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 information

On the Hierarchy of 0 2-Real Numbers

On the Hierarchy of 0 2-Real Numbers On the Hierarchy of 0 2-Real Numbers Xizhong Zheng Theoretische Informatik BTU Cottbus, D-03044 Cottbus, Germany Abstract A real number x is called 0 2 if its binary expansion corresponds to a 0 2-set

More information

Uniform computational complexity of ordinary differential equations with applications to dynamical systems and exact real arithmetic

Uniform computational complexity of ordinary differential equations with applications to dynamical systems and exact real arithmetic 博士論文 Doctoral Dissertation Uniform computational complexity of ordinary differential equations with applications to dynamical systems and exact real arithmetic ( 常微分方程式の一様計算量およびその力学系と厳密数値計算への応用 ) Holger

More information

Hyperbolic Julia Sets are Poly-Time Computable

Hyperbolic Julia Sets are Poly-Time Computable CCA 2004 Preliminary Version Hyperbolic Julia Sets are Poly-Time Computable Mark Braverman 1,2 Dept. of Computer Science University of Toronto Toronto, ON, Canada Abstract In this paper we prove that hyperbolic

More information

Fourth Week: Lectures 10-12

Fourth Week: Lectures 10-12 Fourth Week: Lectures 10-12 Lecture 10 The fact that a power series p of positive radius of convergence defines a function inside its disc of convergence via substitution is something that we cannot ignore

More information

DRAFT. Algebraic computation models. Chapter 14

DRAFT. 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 information

ZEROES OF INTEGER LINEAR RECURRENCES. 1. Introduction. 4 ( )( 2 1) n

ZEROES OF INTEGER LINEAR RECURRENCES. 1. Introduction. 4 ( )( 2 1) n ZEROES OF INTEGER LINEAR RECURRENCES DANIEL LITT Consider the integer linear recurrence 1. Introduction x n = x n 1 + 2x n 2 + 3x n 3 with x 0 = x 1 = x 2 = 1. For which n is x n = 0? Answer: x n is never

More information

Real Interactive Proofs for VPSPACE

Real 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 information

Computational Complexity in Analysis and Geometry. Akitoshi Kawamura

Computational Complexity in Analysis and Geometry. Akitoshi Kawamura Computational Complexity in Analysis and Geometry by Akitoshi Kawamura A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer Science

More information

Chapter 1: Preliminaries and Error Analysis

Chapter 1: Preliminaries and Error Analysis Chapter 1: Error Analysis Peter W. White white@tarleton.edu Department of Tarleton State University Summer 2015 / Numerical Analysis Overview We All Remember Calculus Derivatives: limit definition, sum

More information

Notes for Lecture 3... x 4

Notes 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 information

Monotonically Computable Real Numbers

Monotonically Computable Real Numbers Monotonically Computable Real Numbers Robert Rettinger a, Xizhong Zheng b,, Romain Gengler b, Burchard von Braunmühl b a Theoretische Informatik II, FernUniversität Hagen, 58084 Hagen, Germany b Theoretische

More information

Midterm Review. Igor Yanovsky (Math 151A TA)

Midterm Review. Igor Yanovsky (Math 151A TA) Midterm Review Igor Yanovsky (Math 5A TA) Root-Finding Methods Rootfinding methods are designed to find a zero of a function f, that is, to find a value of x such that f(x) =0 Bisection Method To apply

More information

Review: Power series define functions. Functions define power series. Taylor series of a function. Taylor polynomials of a function.

Review: Power series define functions. Functions define power series. Taylor series of a function. Taylor polynomials of a function. Taylor Series (Sect. 10.8) Review: Power series define functions. Functions define power series. Taylor series of a function. Taylor polynomials of a function. Review: Power series define functions Remarks:

More information

Chapter 8: Taylor s theorem and L Hospital s rule

Chapter 8: Taylor s theorem and L Hospital s rule Chapter 8: Taylor s theorem and L Hospital s rule Theorem: [Inverse Mapping Theorem] Suppose that a < b and f : [a, b] R. Given that f (x) > 0 for all x (a, b) then f 1 is differentiable on (f(a), f(b))

More information

Selçuk Demir WS 2017 Functional Analysis Homework Sheet

Selçuk Demir WS 2017 Functional Analysis Homework Sheet Selçuk Demir WS 2017 Functional Analysis Homework Sheet 1. Let M be a metric space. If A M is non-empty, we say that A is bounded iff diam(a) = sup{d(x, y) : x.y A} exists. Show that A is bounded iff there

More information

Chapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27

Chapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation

More information

CHAPTER 11. A Revision. 1. The Computers and Numbers therein

CHAPTER 11. A Revision. 1. The Computers and Numbers therein CHAPTER A Revision. The Computers and Numbers therein Traditional computer science begins with a finite alphabet. By stringing elements of the alphabet one after another, one obtains strings. A set of

More information

Numbers 1. 1 Overview. 2 The Integers, Z. John Nachbar Washington University in St. Louis September 22, 2017

Numbers 1. 1 Overview. 2 The Integers, Z. John Nachbar Washington University in St. Louis September 22, 2017 John Nachbar Washington University in St. Louis September 22, 2017 1 Overview. Numbers 1 The Set Theory notes show how to construct the set of natural numbers N out of nothing (more accurately, out of

More information

Contents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3

Contents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3 Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability

More information

Chapter 1 Mathematical Preliminaries and Error Analysis

Chapter 1 Mathematical Preliminaries and Error Analysis Chapter 1 Mathematical Preliminaries and Error Analysis Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128A Numerical Analysis Limits and Continuity

More information

MS 3011 Exercises. December 11, 2013

MS 3011 Exercises. December 11, 2013 MS 3011 Exercises December 11, 2013 The exercises are divided into (A) easy (B) medium and (C) hard. If you are particularly interested I also have some projects at the end which will deepen your understanding

More information

Lecture 20: conp and Friends, Oracles in Complexity Theory

Lecture 20: conp and Friends, Oracles in Complexity Theory 6.045 Lecture 20: conp and Friends, Oracles in Complexity Theory 1 Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode:

More information

x x 1 x 2 + x 2 1 > 0. HW5. Text defines:

x x 1 x 2 + x 2 1 > 0. HW5. Text defines: Lecture 15: Last time: MVT. Special case: Rolle s Theorem (when f(a) = f(b)). Recall: Defn: Let f be defined on an interval I. f is increasing (or strictly increasing) if whenever x 1, x 2 I and x 2 >

More information

Chapter 1: Limits and Continuity

Chapter 1: Limits and Continuity Chapter 1: Limits and Continuity Winter 2015 Department of Mathematics Hong Kong Baptist University 1/69 1.1 Examples where limits arise Calculus has two basic procedures: differentiation and integration.

More information

A An Overview of Complexity Theory for the Algorithm Designer

A An Overview of Complexity Theory for the Algorithm Designer A An Overview of Complexity Theory for the Algorithm Designer A.1 Certificates and the class NP A decision problem is one whose answer is either yes or no. Two examples are: SAT: Given a Boolean formula

More information

Math 106 Fall 2014 Exam 2.1 October 31, ln(x) x 3 dx = 1. 2 x 2 ln(x) + = 1 2 x 2 ln(x) + 1. = 1 2 x 2 ln(x) 1 4 x 2 + C

Math 106 Fall 2014 Exam 2.1 October 31, ln(x) x 3 dx = 1. 2 x 2 ln(x) + = 1 2 x 2 ln(x) + 1. = 1 2 x 2 ln(x) 1 4 x 2 + C Math 6 Fall 4 Exam. October 3, 4. The following questions have to do with the integral (a) Evaluate dx. Use integration by parts (x 3 dx = ) ( dx = ) x3 x dx = x x () dx = x + x x dx = x + x 3 dx dx =

More information

On NP-Completeness for Linear Machines

On 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 information

1 What is numerical analysis and scientific computing?

1 What is numerical analysis and scientific computing? Mathematical preliminaries 1 What is numerical analysis and scientific computing? Numerical analysis is the study of algorithms that use numerical approximation (as opposed to general symbolic manipulations)

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered

More information

Second Order ODEs. CSCC51H- Numerical Approx, Int and ODEs p.130/177

Second Order ODEs. CSCC51H- Numerical Approx, Int and ODEs p.130/177 Second Order ODEs Often physical or biological systems are best described by second or higher-order ODEs. That is, second or higher order derivatives appear in the mathematical model of the system. For

More information

Intractable Problems [HMU06,Chp.10a]

Intractable Problems [HMU06,Chp.10a] Intractable Problems [HMU06,Chp.10a] Time-Bounded Turing Machines Classes P and NP Polynomial-Time Reductions A 10 Minute Motivation https://www.youtube.com/watch?v=yx40hbahx3s 1 Time-Bounded TM s A Turing

More information

Polynomial Approximations and Power Series

Polynomial Approximations and Power Series Polynomial Approximations and Power Series June 24, 206 Tangent Lines One of the first uses of the derivatives is the determination of the tangent as a linear approximation of a differentiable function

More information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

MATH 31B: MIDTERM 2 REVIEW. sin 2 x = 1 cos(2x) dx = x 2 sin(2x) 4. + C = x 2. dx = x sin(2x) + C = x sin x cos x

MATH 31B: MIDTERM 2 REVIEW. sin 2 x = 1 cos(2x) dx = x 2 sin(2x) 4. + C = x 2. dx = x sin(2x) + C = x sin x cos x MATH 3B: MIDTERM REVIEW JOE HUGHES. Evaluate sin x and cos x. Solution: Recall the identities cos x = + cos(x) Using these formulas gives cos(x) sin x =. Trigonometric Integrals = x sin(x) sin x = cos(x)

More information

DIFFERENTIATION RULES

DIFFERENTIATION RULES 3 DIFFERENTIATION RULES DIFFERENTIATION RULES We have: Seen how to interpret derivatives as slopes and rates of change Seen how to estimate derivatives of functions given by tables of values Learned how

More information

SPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS

SPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly

More information

Chapter 8. P-adic numbers. 8.1 Absolute values

Chapter 8. P-adic numbers. 8.1 Absolute values Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.

More information

Calculus I Exam 1 Review Fall 2016

Calculus I Exam 1 Review Fall 2016 Problem 1: Decide whether the following statements are true or false: (a) If f, g are differentiable, then d d x (f g) = f g. (b) If a function is continuous, then it is differentiable. (c) If a function

More information

Computational Complexity on Computable Metric Spaces

Computational Complexity on Computable Metric Spaces Electronic Colloquium on Computational Complexity, Report No. 14 (2002) Computational Complexity on Computable Metric Spaces Klaus Weihrauch FernUniversität Hagen 58084 Hagen Germany email: klaus.weihrauch@fernuni-hagen.de

More information

f (n) (z 0 ) Theorem [Morera s Theorem] Suppose f is continuous on a domain U, and satisfies that for any closed curve γ in U, γ

f (n) (z 0 ) Theorem [Morera s Theorem] Suppose f is continuous on a domain U, and satisfies that for any closed curve γ in U, γ Remarks. 1. So far we have seen that holomorphic is equivalent to analytic. Thus, if f is complex differentiable in an open set, then it is infinitely many times complex differentiable in that set. This

More information

MATH 423 Linear Algebra II Lecture 3: Subspaces of vector spaces. Review of complex numbers. Vector space over a field.

MATH 423 Linear Algebra II Lecture 3: Subspaces of vector spaces. Review of complex numbers. Vector space over a field. MATH 423 Linear Algebra II Lecture 3: Subspaces of vector spaces. Review of complex numbers. Vector space over a field. Vector space A vector space is a set V equipped with two operations, addition V V

More information

5. Hand in the entire exam booklet and your computer score sheet.

5. Hand in the entire exam booklet and your computer score sheet. WINTER 2016 MATH*2130 Final Exam Last name: (PRINT) First name: Student #: Instructor: M. R. Garvie 19 April, 2016 INSTRUCTIONS: 1. This is a closed book examination, but a calculator is allowed. The test

More information

Bounded 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 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 information

Math 126: Course Summary

Math 126: Course Summary Math 126: Course Summary Rich Schwartz August 19, 2009 General Information: Math 126 is a course on complex analysis. You might say that complex analysis is the study of what happens when you combine calculus

More information

Mathematical Economics: Lecture 2

Mathematical Economics: Lecture 2 Mathematical Economics: Lecture 2 Yu Ren WISE, Xiamen University September 25, 2012 Outline 1 Number Line The number line, origin (Figure 2.1 Page 11) Number Line Interval (a, b) = {x R 1 : a < x < b}

More information

CS151 Complexity Theory. Lecture 1 April 3, 2017

CS151 Complexity Theory. Lecture 1 April 3, 2017 CS151 Complexity Theory Lecture 1 April 3, 2017 Complexity Theory Classify problems according to the computational resources required running time storage space parallelism randomness rounds of interaction,

More information

Bounded uniformly continuous functions

Bounded uniformly continuous functions Bounded uniformly continuous functions Objectives. To study the basic properties of the C -algebra of the bounded uniformly continuous functions on some metric space. Requirements. Basic concepts of analysis:

More information

Almost transparent short proofs for NP R

Almost 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 information

Problem set 5, Real Analysis I, Spring, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, 1 x (log 1/ x ) 2 dx 1

Problem set 5, Real Analysis I, Spring, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, 1 x (log 1/ x ) 2 dx 1 Problem set 5, Real Analysis I, Spring, 25. (5) Consider the function on R defined by f(x) { x (log / x ) 2 if x /2, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, R f /2

More information

Differentiation. Table of contents Definition Arithmetics Composite and inverse functions... 5

Differentiation. Table of contents Definition Arithmetics Composite and inverse functions... 5 Differentiation Table of contents. Derivatives................................................. 2.. Definition................................................ 2.2. Arithmetics...............................................

More information

f (x) = k=0 f (0) = k=0 k=0 a k k(0) k 1 = a 1 a 1 = f (0). a k k(k 1)x k 2, k=2 a k k(k 1)(0) k 2 = 2a 2 a 2 = f (0) 2 a k k(k 1)(k 2)x k 3, k=3

f (x) = k=0 f (0) = k=0 k=0 a k k(0) k 1 = a 1 a 1 = f (0). a k k(k 1)x k 2, k=2 a k k(k 1)(0) k 2 = 2a 2 a 2 = f (0) 2 a k k(k 1)(k 2)x k 3, k=3 1 M 13-Lecture Contents: 1) Taylor Polynomials 2) Taylor Series Centered at x a 3) Applications of Taylor Polynomials Taylor Series The previous section served as motivation and gave some useful expansion.

More information

Higher order derivatives of the inverse function

Higher order derivatives of the inverse function Higher order derivatives of the inverse function Andrej Liptaj Abstract A general recursive and limit formula for higher order derivatives of the inverse function is presented. The formula is next used

More information

NATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, February 2, Time Allowed: Two Hours Maximum Marks: 40

NATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, February 2, Time Allowed: Two Hours Maximum Marks: 40 NATIONAL BOARD FOR HIGHER MATHEMATICS Research Scholarships Screening Test Saturday, February 2, 2008 Time Allowed: Two Hours Maximum Marks: 40 Please read, carefully, the instructions on the following

More information

Section 10.7 Taylor series

Section 10.7 Taylor series Section 10.7 Taylor series 1. Common Maclaurin series 2. s and approximations with Taylor polynomials 3. Multiplication and division of power series Math 126 Enhanced 10.7 Taylor Series The University

More information

Relative computability and uniform continuity of relations

Relative computability and uniform continuity of relations 1 39 ISSN 1759-9008 1 Relative computability and uniform continuity of relations ARNO PAULY MARTIN ZIEGLER Abstract: A type-2 computable real function is necessarily continuous; and this remains true for

More information

where Q is a finite set of states

where Q is a finite set of states Space Complexity So far most of our theoretical investigation on the performances of the various algorithms considered has focused on time. Another important dynamic complexity measure that can be associated

More information

Simple Iteration, cont d

Simple Iteration, cont d Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 2 Notes These notes correspond to Section 1.2 in the text. Simple Iteration, cont d In general, nonlinear equations cannot be solved in a finite sequence

More information

JUST THE MATHS UNIT NUMBER DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) A.J.Hobson

JUST THE MATHS UNIT NUMBER DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) A.J.Hobson JUST THE MATHS UNIT NUMBER.5 DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) by A.J.Hobson.5. Maclaurin s series.5. Standard series.5.3 Taylor s series.5.4 Exercises.5.5 Answers to exercises

More information

SECTION A. f(x) = ln(x). Sketch the graph of y = f(x), indicating the coordinates of any points where the graph crosses the axes.

SECTION A. f(x) = ln(x). Sketch the graph of y = f(x), indicating the coordinates of any points where the graph crosses the axes. SECTION A 1. State the maximal domain and range of the function f(x) = ln(x). Sketch the graph of y = f(x), indicating the coordinates of any points where the graph crosses the axes. 2. By evaluating f(0),

More information

A note on parallel and alternating time

A 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 information

Supplementary Notes for W. Rudin: Principles of Mathematical Analysis

Supplementary Notes for W. Rudin: Principles of Mathematical Analysis Supplementary Notes for W. Rudin: Principles of Mathematical Analysis SIGURDUR HELGASON In 8.00B it is customary to cover Chapters 7 in Rudin s book. Experience shows that this requires careful planning

More information

8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0

8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0 8.7 Taylor s Inequality Math 00 Section 005 Calculus II Name: ANSWER KEY Taylor s Inequality: If f (n+) is continuous and f (n+) < M between the center a and some point x, then f(x) T n (x) M x a n+ (n

More information

Separating NE from Some Nonuniform Nondeterministic Complexity Classes

Separating NE from Some Nonuniform Nondeterministic Complexity Classes Separating NE from Some Nonuniform Nondeterministic Complexity Classes Bin Fu 1, Angsheng Li 2, and Liyu Zhang 3 1 Dept. of Computer Science, University of Texas - Pan American TX 78539, USA. binfu@cs.panam.edu

More information

MT804 Analysis Homework II

MT804 Analysis Homework II MT804 Analysis Homework II Eudoxus October 6, 2008 p. 135 4.5.1, 4.5.2 p. 136 4.5.3 part a only) p. 140 4.6.1 Exercise 4.5.1 Use the Intermediate Value Theorem to prove that every polynomial of with real

More information

Immerse Metric Space Homework

Immerse Metric Space Homework Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps

More information

Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION

Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from

More information

PHY411 Lecture notes Part 5

PHY411 Lecture notes Part 5 PHY411 Lecture notes Part 5 Alice Quillen January 27, 2016 Contents 0.1 Introduction.................................... 1 1 Symbolic Dynamics 2 1.1 The Shift map.................................. 3 1.2

More information

Calculus II Lecture Notes

Calculus II Lecture Notes Calculus II Lecture Notes David M. McClendon Department of Mathematics Ferris State University 206 edition Contents Contents 2 Review of Calculus I 5. Limits..................................... 7.2 Derivatives...................................3

More information

Discrete Mathematics CS October 17, 2006

Discrete Mathematics CS October 17, 2006 Discrete Mathematics CS 2610 October 17, 2006 Uncountable sets Theorem: The set of real numbers is uncountable. If a subset of a set is uncountable, then the set is uncountable. The cardinality of a subset

More information

ITCS:CCT09 : Computational Complexity Theory Apr 8, Lecture 7

ITCS:CCT09 : Computational Complexity Theory Apr 8, Lecture 7 ITCS:CCT09 : Computational Complexity Theory Apr 8, 2009 Lecturer: Jayalal Sarma M.N. Lecture 7 Scribe: Shiteng Chen In this lecture, we will discuss one of the basic concepts in complexity theory; namely

More information

Abstract. 2. We construct several transcendental numbers.

Abstract. 2. We construct several transcendental numbers. Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study

More information

1 Computational Problems

1 Computational Problems Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation

More information

CLASS NOTES FOR APRIL 14, 2000

CLASS NOTES FOR APRIL 14, 2000 CLASS NOTES FOR APRIL 14, 2000 Announcement: Section 1.2, Questions 3,5 have been deferred from Assignment 1 to Assignment 2. Section 1.4, Question 5 has been dropped entirely. 1. Review of Wednesday class

More information

On the equivalence of some approaches to computability on the real line

On the equivalence of some approaches to computability on the real line On the equivalence of some approaches to computability on the real line Dieter Spreen, Holger Schulz Fachbereich Mathematik, AG Theoretische Informatik, Universität Siegen 57068 Siegen, Germany Abstract

More information

= F (b) F (a) F (x i ) F (x i+1 ). a x 0 x 1 x n b i

= F (b) F (a) F (x i ) F (x i+1 ). a x 0 x 1 x n b i Real Analysis Problem 1. If F : R R is a monotone function, show that F T V ([a,b]) = F (b) F (a) for any interval [a, b], and that F has bounded variation on R if and only if it is bounded. Here F T V

More information

Q = Set of states, IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar

Q = Set of states, IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar Turing Machine A Turing machine is an abstract representation of a computing device. It consists of a read/write

More information

MATH 202B - Problem Set 5

MATH 202B - Problem Set 5 MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there

More information

Analysis Qualifying Exam

Analysis Qualifying Exam Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,

More information

CS154, Lecture 17: conp, Oracles again, Space Complexity

CS154, Lecture 17: conp, Oracles again, Space Complexity CS154, Lecture 17: conp, Oracles again, Space Complexity Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode: Guess string

More information

The basic feasible functionals in computable analysis

The basic feasible functionals in computable analysis Journal of Complexity 22 (2006) 909 917 www.elsevier.com/locate/jco The basic feasible functionals in computable analysis Branimir Lambov a,b, a BRICS, University of Aarhus, IT Parken, 8200 Aarhus N, Denmark

More information

Metric Spaces and Topology

Metric Spaces and Topology Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies

More information

The Arzelà-Ascoli Theorem

The Arzelà-Ascoli Theorem John Nachbar Washington University March 27, 2016 The Arzelà-Ascoli Theorem The Arzelà-Ascoli Theorem gives sufficient conditions for compactness in certain function spaces. Among other things, it helps

More information

A brief introduction to p-adic numbers

A brief introduction to p-adic numbers arxiv:math/0301035v2 [math.ca] 7 Jan 2003 A brief introduction to p-adic numbers Stephen Semmes Abstract In this short survey we look at a few basic features of p-adic numbers, somewhat with the point

More information

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can

More information

Theoretical Cryptography, Lectures 18-20

Theoretical Cryptography, Lectures 18-20 Theoretical Cryptography, Lectures 18-20 Instructor: Manuel Blum Scribes: Ryan Williams and Yinmeng Zhang March 29, 2006 1 Content of the Lectures These lectures will cover how someone can prove in zero-knowledge

More information

Limitations of Efficient Reducibility to the Kolmogorov Random Strings

Limitations of Efficient Reducibility to the Kolmogorov Random Strings Limitations of Efficient Reducibility to the Kolmogorov Random Strings John M. HITCHCOCK 1 Department of Computer Science, University of Wyoming Abstract. We show the following results for polynomial-time

More information

1. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x.

1. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x. Advanced Calculus I, Dr. Block, Chapter 2 notes. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x. 2. Definition. A sequence is a real-valued function

More information

Compute the Fourier transform on the first register to get x {0,1} n x 0.

Compute the Fourier transform on the first register to get x {0,1} n x 0. CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary

More information

11.10a Taylor and Maclaurin Series

11.10a Taylor and Maclaurin Series 11.10a 1 11.10a Taylor and Maclaurin Series Let y = f(x) be a differentiable function at x = a. In first semester calculus we saw that (1) f(x) f(a)+f (a)(x a), for all x near a The right-hand side of

More information

Notes for Lecture Notes 2

Notes for Lecture Notes 2 Stanford University CS254: Computational Complexity Notes 2 Luca Trevisan January 11, 2012 Notes for Lecture Notes 2 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation

More information

Contraction Mappings Consider the equation

Contraction Mappings Consider the equation Contraction Mappings Consider the equation x = cos x. If we plot the graphs of y = cos x and y = x, we see that they intersect at a unique point for x 0.7. This point is called a fixed point of the function

More information

Numbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 =

Numbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 = 2 Numbers 2.1 Integers You remember the definition of a prime number. On p. 7, we defined a prime number and formulated the Fundamental Theorem of Arithmetic. Numerous beautiful results can be presented

More information