On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is...
Transcript of On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is...
![Page 1: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/1.jpg)
On the query complexity of realfunctionals
Hugo FéréeWalid Gomaa Mathieu Hoyrup
April 10, 2013
Hugo Férée Journées Calculabilités 2013 1/14
![Page 2: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/2.jpg)
computability ←→ continuity
complexity bound ←→ analytical properties
Hugo Férée Journées Calculabilités 2013 1/14
![Page 3: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/3.jpg)
Computing with real numbers(qn)n∈N x if ∀n, |x − qn| ≤ 2−n
R ∼ (N→ N)Model: Oracle Turing MachinesFinite-time computation −→ finite number of queries
−→ finite knowledge of the input−→ continuity
Bounding computation time ⇐⇒ bounding• the computational power• the number of queries
Hugo Férée Journées Calculabilités 2013 2/14
![Page 4: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/4.jpg)
Computing with real numbers(qn)n∈N x if ∀n, |x − qn| ≤ 2−n
R ∼ (N→ N)Model: Oracle Turing MachinesFinite-time computation −→ finite number of queries
−→ finite knowledge of the input−→ continuity
Bounding computation time ⇐⇒ bounding• the computational power• the number of queries
Hugo Férée Journées Calculabilités 2013 2/14
![Page 5: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/5.jpg)
Theoremf : R→ R computable w.r.t. an oracle
⇐⇒ f is continuous.
Theoremf : R→ R polynomial time computable w.r.t. an oracle
⇐⇒ its modulus of continuity is bounded by a polynomial.
Hugo Férée Journées Calculabilités 2013 3/14
![Page 6: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/6.jpg)
f ∈ C[0, 1] ⇐⇒ ∃µ, fQ :modulus of continuity : µ : N→ N
|x − y | ≤ 2−µ(n) =⇒ |f (x)− f (y )| ≤ 2−n
approximation function fQ : Q× N→ Q
|fQ(q, n)− f (q)| ≤ 2−n
C[0, 1] ∼ N→ N
Hugo Férée Journées Calculabilités 2013 4/14
![Page 7: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/7.jpg)
f ∈ C[0, 1] ⇐⇒ ∃µ, fQ :modulus of continuity : µ : N→ N
|x − y | ≤ 2−µ(n) =⇒ |f (x)− f (y )| ≤ 2−n
approximation function fQ : Q× N→ Q
|fQ(q, n)− f (q)| ≤ 2−n
C[0, 1] ∼ N→ N
Hugo Férée Journées Calculabilités 2013 4/14
![Page 8: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/8.jpg)
TheoremF : C[0, 1]→ R computable w.r.t. an oracle
⇐⇒ F is continuous.
Theorem?F : C[0, 1]→ R polynomial time computable w.r.t. an oracle
⇐⇒ ?
Hugo Férée Journées Calculabilités 2013 5/14
![Page 9: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/9.jpg)
The uniform norm is in EXP \ P(even in NP \ P!)
f
Hugo Férée Journées Calculabilités 2013 6/14
![Page 10: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/10.jpg)
The uniform norm is in EXP \ P(even in NP \ P!)
g||F (f )− F (g)||∞ � 2−n
f
Hugo Férée Journées Calculabilités 2013 6/14
![Page 11: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/11.jpg)
Dependence of a norm on a pointdF ,α (n) = sup{l : ∃f ∈ Lip1, Supp(f ) ⊆ N (α, 1/l ) and F (f ) > 2−n}
1/lf
︸︷︷︸α
ExampleF = ||.||∞ =⇒ dF ,α (n) ∼ 2n
F = ||.||1 =⇒ dF ,α (n) ∼ 2n2
Hugo Férée Journées Calculabilités 2013 7/14
![Page 12: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/12.jpg)
Relevant points
Rn,l = {α : dF ,α (n) ≥ l}Definitionα is relevant if ∃c > 0,∀n, dF ,α (n) ≥ c · 2 n
2
R = ⋃k
⋂n
Rn,2 n2−k
︸ ︷︷ ︸Rk
ExampleFor ||.||∞ and ||.||1, R = [0, 1].
Hugo Férée Journées Calculabilités 2013 8/14
![Page 13: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/13.jpg)
Theoremf = 0 on R2µf (k) =⇒ F (f ) ≤ c .2−k .
Corollaryf = g on Rµ(k) =⇒ |F (f )− F (g )| ≤ 2−k .
TheoremR is dense.
Hugo Férée Journées Calculabilités 2013 9/14
![Page 14: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/14.jpg)
R is dense (proof)
h0
︸ ︷︷ ︸2−p
F (h0) ≥ 2−c
Hugo Férée Journées Calculabilités 2013 10/14
![Page 15: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/15.jpg)
R is dense (proof)
h1
︸ ︷︷ ︸2−p−1
F (h1) ≥ 2−c−2
Hugo Férée Journées Calculabilités 2013 10/14
![Page 16: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/16.jpg)
R is dense (proof)
h2
︸︷︷︸2−p−2
F (h2) ≥ 2−c−4
Hugo Férée Journées Calculabilités 2013 10/14
![Page 17: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/17.jpg)
R is dense (proof)
α
F (hn) ≥ 2−c−2n
dF ,α (2n + c) ≥ 2n+p =⇒ α ∈ R
Hugo Férée Journées Calculabilités 2013 10/14
![Page 18: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/18.jpg)
Query complexityQn : oracle calls of F on x 7→ 0 with precision 2−n.
PropositionRn,l ⊆ N (Qn+1, 1l )
DefinitionF has a polynomial query complexity if it is computable bya relativized OTM with |Qn| ≤ P(n).
Hugo Férée Journées Calculabilités 2013 11/14
![Page 19: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/19.jpg)
TheoremIf F has polynomial query complexity, then almost everypoint has a polynomial dependency.TheoremIf F has polynomial query complexity, then R has Hausdorffdimension 0.Proposition
F has polynomial query complexity=⇒ ∃α, 2n
dF ,α (n) is bounded by a polynomial.
Hugo Férée Journées Calculabilités 2013 12/14
![Page 20: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/20.jpg)
TheoremF is polynomial time computable w.r.t. an oracle
⇐⇒ F has polynomial query complexity⇐⇒ Rk can be polynomially covered (wrt. k).
Open questionCan it be generalized for any F : C[0, 1]→ R?
Hugo Férée Journées Calculabilités 2013 13/14
![Page 21: On the query complexity of real functionalsf : R →R computable w.r.t. an oracle ⇒f is continuous. Theorem f : R →R polynomial time computable w.r.t. an oracle ⇒its modulus](https://reader035.fdocuments.in/reader035/viewer/2022071404/60f919e8858c5166614dbcca/html5/thumbnails/21.jpg)
One oracle access caseTheoremThe following are equivalent:• F is computable by a polynomial time machine doing
only one oracle query• ∀f ,F (f ) = φ(f (α)) where:
• α ∈ Poly (R) (but cannot be efficiently retrived from F !)• φ ∈ Poly (R→ R)• φ is uniformly continuous
Open questionGeneralization to any finite number of queries?
Hugo Férée Journées Calculabilités 2013 14/14