کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
429698 687638 2008 33 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Probabilistic and team PFIN-type learning: General properties
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Probabilistic and team PFIN-type learning: General properties
چکیده انگلیسی

We consider the probability hierarchy for Popperian FINite learning and study the general properties of this hierarchy. We prove that the probability hierarchy is decidable, i.e. there exists an algorithm that receives p1 and p2 and answers whether PFIN-type learning with the probability of success p1 is equivalent to PFIN-type learning with the probability of success p2.To prove our result, we analyze the topological structure of the probability hierarchy. We prove that it is well-ordered in descending ordering and order-equivalent to ordinal ϵ0. This shows that the structure of the hierarchy is very complicated.Using similar methods, we also prove that, for PFIN-type learning, team learning and probabilistic learning are of the same power.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computer and System Sciences - Volume 74, Issue 4, June 2008, Pages 457-489