کد مقاله کد نشریه سال انتشار مقاله انگلیسی ترجمه فارسی نسخه تمام متن
4661576 1344844 2016 25 صفحه PDF ندارد دانلود رایگان
عنوان انگلیسی مقاله
Inductive inference and reverse mathematics
ترجمه فارسی عنوان
استنتاج استقرایی و ریاضیات معکوس
کلمات کلیدی
ریاضیات معکوس؛ نظریه بازگشتی؛ استنتاج استقرایی؛ یادگیری از داده های مثبت
03D70; 03D80; 03H15; 03D75Reverse mathematics; Recursion theory; Inductive inference; Learning from positive data
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات منطق ریاضی
چکیده انگلیسی

The present work investigates inductive inference from the perspective of reverse mathematics. Reverse mathematics is a framework that allows gauging the proof strength of theorems and axioms in many areas of mathematics. The present work applies its methods to basic notions of algorithmic learning theory such as Angluin's tell-tale criterion and its variants for learning in the limit and for conservative learning, as well as to the more general scenario of partial learning. These notions are studied in the reverse mathematics context for uniformly and weakly represented families of languages. The results are stated in terms of axioms referring to induction strength and to domination of weakly represented families of functions.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Annals of Pure and Applied Logic - Volume 167, Issue 12, December 2016, Pages 1242–1266
نویسندگان
, , ,