• Keine Ergebnisse gefunden

Computable Urysohn

N/A
N/A
Protected

Academic year: 2022

Aktie "Computable Urysohn"

Copied!
3
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Martin Ziegler

Computable Urysohn

Proof

Proof : : Let Let f f ( ( x x ):= ):= ∑ ∑

mm

rrmm rrmm++εεmm rrmm--εεmm

εεmm//22mm

LetLet

( ( r r

mm

) )

mm

, , ( ( ε ε

mm

) )

mm

⊆ ⊆ Q Q

bebe computablecomputable sequencessequences

ThenThen therethere isis a a computablecomputable

f f :[0;1] :[0;1] → → [0;1] [0;1]

s.t.

s.t.

f f

--11

[0] = [0;1] [0] = [0;1] \ \  

mm

( ( r r

mm

- - ε ε

mm

, , r r

mm

+ + ε ε

mm

) )

..

max(0,

max(0, ε ε

mm

- - | | x x - - r r

mm

|)/ |)/ 2 2

mm

CC

CC ''pulse' functionpulse' function

φφ((tt) = ) = exp(exp(--tt²²/1/1--tt²²))

||tt|<1|<1

(2)

Martin Ziegler

Specker'59: Uncomputable roots/argminapproximatingapproximating aa rootroot vsvs. . approximateapproximate rootroot

Lemma:

Lemma: ThereThere areare computablecomputable sequencessequences

( ( r r

mm

) )

mm

, , ( ( ε ε

mm

) )

mm

⊆ ⊆ Q Q

s.t. s.t.

U U := :=  

mm

( ( r r

mm

- - ε ε

mm

, , r r

mm

+ + ε ε

mm

) )

contains

contains all all computablecomputable realsreals in [0;1]in [0;1]

and has

and has measuremeasure <<½½..

Corollary

Corollary:: ThereThere isis a a computablecomputable CC

f f :[0;1] :[0;1] → → [0;1] [0;1]

s.t. s.t.

f f

--11

[0] [0]

has has measuremeasure >>½½

butbut containscontains nono computablecomputable real real numbernumber.. LetLet

( ( r r

mm

) )

mm

, , ( ( ε ε

mm

) )

mm

⊆ ⊆ Q Q

bebe computablecomputable sequencessequences

ThenThen therethere isis a a computablecomputable

f f :[0;1] :[0;1] → → [0;1] [0;1]

s.t.

s.t.

f f

--11

[0] = [0;1] [0] = [0;1] \ \  

mm

( ( r r

mm

- - ε ε

mm

, , r r

mCCm

+ + ε ε

mm

) )

..

(3)

Martin Ziegler

Singular Covering of Computable Reals

Lemma:

Lemma: ThereThere areare computablecomputable sequencessequences

( ( r r

mm

) )

mm

, , ( ( ε ε

mm

) )

mm

⊆ ⊆ Q Q

s.t. s.t.

U U := :=  

mm

( ( r r

mm

- - ε ε

mm

, , r r

mm

+ + ε ε

mm

) )

contains

contains all all computablecomputable realsreals in [0;1]in [0;1]

and has

and has measure measure <<½½.. Proof

Proof:: DoveDove--tailingtailing w.r.tw.r.t. (. (

M M , , t t ) )

:: IfIf Turing Turing machinemachine

# # M M

withinwithin

t t

((butbut notnot

t t - - 1 1

) ) stepssteps printsprints

a a

11

, , … … a a

MM+5+5

s.t.

s.t.

| | a a

kk

/2 /2

kk+1+1

- - a a

/2 /2

+1+1

| | ≤ ≤ 2 2

--kk

+2 +2

--

∀1 ∀ 1 ≤ ≤ k k , , ℓ ℓ ≤ ≤ M M +5 +5

thenthen letlet

r r

M,t〉M,t

:= := a a

MM+5+5

/2 /2

M+6M+6 and and

ε ε

M,tM,t

:= := 2 2

-M-M--55,, elseelse

r r

M,tM,t

:= := 0 0

and and

ε ε

M,t〉M,t

:= 2 := 2

--M,t〉M,t-3-3..

Machine

Machine computescomputes rr∈∈RR

iffiff prints seq. prints seq. aann withwith ||aann/2/2n+1 n+1 -- aamm/2/2m+1 m+1 ||≤≤22--n n ++22--mm..

Referenzen

ÄHNLICHE DOKUMENTE

Theorem: For For f f :[0,1] :[0,1] → → the the following following are are equivalent equivalent : : a) a) There There is is an an algorithm algorithm converting converting

Eintrag im i-ten Bin setzen Eintrag im i-ten Bin auslesen Fehler im i-ten Bin setzten Histogramm zeichnen.

The argument of the method Draw(&#34;AP&#34;) is important here. It tells the TGraphPainter class to show the axes and to plot mark- ers at the x and y positions of the specified

The argument of the method Draw(&#34;AP&#34;) is important here. It tells the TGraphPainter class to show the axes and to plot mark- ers at the x and y positions of the specied

(Note that this is not really a multiplication, since vw is a scalar while v and w

These models were approximated using LTI systems accompanied with an explicit bound on the approximation error.. An important property of contractive systems is that they entrain to

In this paper, our main interest lies in extrapolation methods, especially in the visualization of order of convergence results, for the discrete approximation of reachable sets

We show that the problem is NP-complete for arbitrary number of colors and we provide algorithms that given a feasible instance find a coloring that satisfies all the