

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The ninth homework assignment for math 497a, a university-level course on computability, unsolvability, and randomness. The assignment, authored by stephen g. Simpson, covers topics such as hoeffding's inequality, the strong law of large numbers, weakly 1-random points, and biimmune sets. Students are asked to prove various mathematical statements and theorems related to these topics.
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


N with the fair
coin probability measure satisfies
Prob
n− 1 i=
X(i)
n
exp 2n
2
Use Hoeffding’s Inequality to prove that if a point X ∈ 2
N is random
(i.e., random in the sense of Martin-L¨of), then X obeys the Strong Law
of Large Numbers:
n− 1 i=
X(i)
n
as n → ∞.
N which do not obey
the Strong Law of Large Numbers.
Hint: Use finite approximation.
1/2?
N is random (i.e., random in the sense of
Martin-L¨of), then X T Y and Y T X.
N such that X ⊕ Y is weakly
1-random yet X ≡T Y.
N \ B are immune. Prove that if X ∈ 2
N is weakly 1-random then X
is the characteristic function of a biimmune set.
For each i ∈ N define
f i =^ {X^ ∈^2
N | ϕ
(1),f ⊕X i (0)^ ↓}.
Thus U
f i ,^ i^ = 0,^1 ,^2 ,...^ is the standard recursive enumeration of all
Σ
0 ,f 1 subsets of 2
N .
Given a sequence of sets Vn ⊆ 2
N , n = 0, 1 , 2 ,.. ., prove that the follow-
ing are pairwise equivalent.
(a) There exists a total recursive function g such that Vn = U
f g(n) for
all n.
(b) There exists a total f -recursive function h such that Vn = U
f h(n)
for all n.
(c) The predicate P ⊆ 2
N × N given by
P (X, n) ≡ X ∈ Vn
is Σ
0 ,f
In this case we say that the sequence of sets Vn, n = 0, 1 , 2 ,... is
uniformly Σ
0 ,f 1 or^ uniformly^ Σ
0 1 relative to^ f^.
Note: This concept will be part of the definition of what it means for
a point X ∈ 2
N to be random relative to the oracle f.