کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
422158 685035 2008 16 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Singular Coverings and Non-Uniform Notions of Closed Set Computability
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Singular Coverings and Non-Uniform Notions of Closed Set Computability
چکیده انگلیسی

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskiĭ, Tseĭtin, Kreisel, and Lacombe have asserted the existence of non-empty co-r.e. closed sets devoid of computable points: sets which are even ‘large’ in the sense of positive Lebesgue measure.This leads us to investigate for various classes of computable real subsets whether they always contain a (not necessarily effectively findable) computable point.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 202, 21 March 2008, Pages 73-88