Non-cupping and randomness

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-cupping and Randomness

Let Y ∈ ∆2 be Martin-Löf-random. Then there is a promptly simple set A such that for each Martin-Löf-random set Z, Y ≤T A ⊕ Z ⇒ Y ≤T Z. When Y = Ω, one obtains a c.e. non-computable set A which is not weakly Martin-Löf cuppable. That is, for any Martin-Löf-random set Z, if ∅′ ≤T A⊕ Z, then ∅′ ≤T Z.

متن کامل

Random non-cupping revisited

Say that Y has the strong random anticupping property if there is a set A such that for every Martin-Löf random set R

متن کامل

Immunity and Non-Cupping for Closed Sets

We extend the notion of immunity to closed sets and to Π1 classes in particular in two ways: immunity meaning the corresponding tree has no infinite computable subset, and tree-immunity meaning it has no infinite computable subtree. We separate these notions from each other and that of being special, and show separating classes for computably inseparable c.e. sets are immune and perfect thin cl...

متن کامل

Randomness and Non-determinism

Exponentiation makes the difference between the bit-size of this line and the number (≪ 2) of particles in the known Universe. The expulsion of exponential time algorithms from Computer Theory in the 60’s broke its umbilical cord from Mathematical Logic. It created a deep gap between deterministic computation and – formerly its unremarkable tools – randomness and non-determinism. Little did we ...

متن کامل

Randomness and non-uniformity

In the first part, we introduce randomized algorithms as a new notion of efficient algorithms for decision problems. We classify randomized algorithms according to their error probabilities, and define appropriate complexity classes. (RP, coRP, ZPP, BPP, PP). We discuss which classes are realistic proposals for design of probabilistic algorithms. We cover the implementation of randomized algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2006

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-06-08540-6