کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
438341 690260 2007 20 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Ockham’s razor, empirical complexity, and truth-finding efficiency
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Ockham’s razor, empirical complexity, and truth-finding efficiency
چکیده انگلیسی

The nature of empirical simplicity and its relationship to scientific truth are long-standing puzzles. In this paper, empirical simplicity is explicated in terms of empirical effects, which are defined in terms of the structure of the inference problem addressed. Problem instances are classified according to the number of empirical effects they present. Simple answers are satisfied by simple worlds. An efficient solution achieves the optimum worst-case cost over each complexity class with respect to such costs as the number of retractions or errors prior to convergence and elapsed time to convergence. It is shown that always choosing the simplest theory compatible with experience and hanging on to it while it remains the simplest is both necessary and sufficient for efficiency.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 383, Issues 2–3, 18 September 2007, Pages 270-289