Genericity and Randomness over Feasible Probability Measures
نویسندگان
چکیده
This paper investigates the notion of resource bounded genericity developed by Ambos Spies Fleischhack and Huwig Ambos Spies Neis and Terwijn have recently shown that every language that is t n random over the uniform probability measure is t n generic It is shown here that in fact every language that is t n random over any strongly positive t n computable probability measure is t n generic Roughly speaking this implies that when genericity is used to prove a resource bounded measure re sult the result is not speci c to the underlying probability measure This research was supported in part by National Science Foundation Grant CCR with matching funds from Rockwell Microware Systems Corpo ration and Amoco Foundation Color LaserJet and Consumables Division Hewlett Packard Company Boise ID U S A E mail amy lorentz hp boise om om hp com Department of Computer Science Iowa State University Ames IA U S A E mail lutz cs iastate edu
منابع مشابه
Lowness for Weak Genericity and Randomness
We prove that lowness for weak genericity is equivalent to semicomputable traceability which is strictly between hyperimmune-freeness and computable traceability. We also show that semi-computable traceability implies lowness for weak randomness. These results refute a conjecture raised by several people.
متن کاملRelativizations of Randomness and Genericity Notions
A set A is a base for Schnorr randomness if it is Turing reducible to a set R which is Schnorr random relative to A, and the notion of a base for weak 1-genericity can be defined similarly. We show that A is a base for Schnorr randomness if and only if A is a base for weak 1-genericity if and only if the halting set K is not Turing reducible to A. Furthermore, we define a set A to be high for S...
متن کاملGeneralized Vershik’s Theorem and Generic Metric Structures
We compare three notions of genericity of separable metric structures. Our analysis provides a general model theoretic technique of showing that structures are generic in discriptive set theoretic (topological) sense and in measure theoretic sense. In particular, it gives a new perspective on Vershik’s theorems on genericity and randomness of Urysohn’s space among separable metric spaces.
متن کاملGeneric Separable Metric Structures
We compare three notions of genericity of separable metric structures. Our analysis provides a general model theoretic technique of showing that structures are generic in descriptive set theoretic (topological) sense and in measure theoretic sense. In particular, it gives a new perspective on Vershik’s theorems on genericity and randomness of Urysohn’s space among separable metric spaces.
متن کاملComputability of probability measures and Martin-Lof randomness over metric spaces
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show that any computable metric space with a computable probability measure is isomorphic to the Cantor space in a computable and measure-theoretic sense. We show th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997