کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
9657797 690106 2005 47 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Uniform test of algorithmic randomness over a general space
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Uniform test of algorithmic randomness over a general space
چکیده انگلیسی
The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These restrictions seem artificial. Some progress has been made to extend the theory to arbitrary Bernoulli distributions (by Martin-Löf) and to arbitrary distributions (by Levin). We recall the main ideas and problems of Levin's theory, and report further progress in the same framework. The issues are the following:
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 341, Issues 1–3, 5 September 2005, Pages 91-137
نویسندگان
,