153
个编辑
更改
无编辑摘要
In computer science, evolutionary computation is a family of algorithms for global optimization inspired by biological evolution, and the subfield of artificial intelligence and soft computing studying these algorithms. In technical terms, they are a family of population-based trial and error problem solvers with a metaheuristic or stochastic optimization character.
In computer science, evolutionary computation is a family of algorithms for global optimization inspired by biological evolution, and the subfield of artificial intelligence and soft computing studying these algorithms. In technical terms, they are a family of population-based trial and error problem solvers with a metaheuristic or stochastic optimization character.
在计算机科学中，演化计算<font color="#ff8000"> 演化计算Evolutionary computation</font>是一个受生物进化启发的全局优化算法家族，人工智能和软计算的子领域研究这些算法。用技术术语来讲，他们是一个基于人口试验和错误的问题解决并具有亚启发式或随机优化性质的家族。
Evolutionary automata, a generalization of Evolutionary Turing machines, have been introduced in order to investigate more precisely properties of biological and evolutionary computation. In particular, they allow to obtain new results on expressiveness of evolutionary computation. This confirms the initial result about undecidability of natural evolution and evolutionary algorithms and processes. Evolutionary finite automata, the simplest subclass of Evolutionary automata working in terminal mode can accept arbitrary languages over a given alphabet, including non-recursively enumerable (e.g., diagonalization language) and recursively enumerable but not recursive languages (e.g., language of the universal Turing machine).
Evolutionary automata, a generalization of Evolutionary Turing machines, have been introduced in order to investigate more precisely properties of biological and evolutionary computation. In particular, they allow to obtain new results on expressiveness of evolutionary computation. This confirms the initial result about undecidability of natural evolution and evolutionary algorithms and processes. Evolutionary finite automata, the simplest subclass of Evolutionary automata working in terminal mode can accept arbitrary languages over a given alphabet, including non-recursively enumerable (e.g., diagonalization language) and recursively enumerable but not recursive languages (e.g., language of the universal Turing machine).
进化自动机是进化图灵机<font color="#ff8000"> 图灵机Turing machines</font>的一种推广，为了更精确地研究生物和进化计算的性质，人们引入了它。特别是，他们允许在进化计算的表现力上获得新的结果。这证实了关于自然进化和进化算法及过程不可判定性的初步结果。进化有限自动机是进化自动机中最简单的子类，在终端模式下可以接受给定字母表上的任意语言，包括非递归的可枚举语言(例如，对角化语言)和递归的可枚举但不递归语言(例如，通用图灵机语言)。