Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
Computability and Randomness
Hi-index | 0.00 |
Let Γ be a set of functions on the natural numbers. We introduce a new randomness notion called semi Γ-randomness, which is associated with a Γ-indexed test. Fix a computable sequence {Gn}n∈ω of all c.e. open sets. For any f∈Γ, {Gf(n)}n∈ω is called a Γ-indexed test if μ(Gf(n))≤2−n for all n. We prove that weak n-randomness is strictly stronger than semi $\Delta^0_n$-randomness, for n2. Moreover, we investigate the relationships between various definitions of randomness.