کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10884688 1079479 2005 19 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Toward a theory of evolutionary computation
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات مدل‌سازی و شبیه سازی
پیش نمایش صفحه اول مقاله
Toward a theory of evolutionary computation
چکیده انگلیسی
The expressiveness of evolutionary computation is investigated. We show that the problem of the best evolutionary algorithm is undecidable independently of whether the fitness function is time dependent or fixed. It is demonstrated that the evolutionary computation paradigm is more expressive than Turing Machines, and thus the conventional computer science based on them. We show that an Evolutionary Turing Machine is able to solve nonalgorithmically the halting problem of the Universal Turing Machine and, asymptotically, the best evolutionary algorithm problem. In other words, the best evolutionary algorithm does not exist, but it can be potentially indefinitely approximated using evolutionary techniques.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Biosystems - Volume 82, Issue 1, October 2005, Pages 1-19
نویسندگان
,