Computational Capabilities of Soft-Computing Frameworks: An Overview
Narendra S. Chaudhari, Yew-Soon Ong, Veena Trivedi · 2006
In theoretical computer science, it is well-established fact that Turing model (and its equivalent models like Chomsky's phrase structured grammar model, or recursively enumerable functions) is a most general model for computation. Many biologically inspired computing paradigms such as traditional neural networks, genetic algorithms, evolutionary computing frameworks etc., aim at addressing the problem of automatic generation of algorithmic solutions for many computationally difficult problems. Various soft computing models have complementary capabilities. This motivates us to investigate systematic framework for their integration. In this paper, we give an overview of the computational capabilities of some soft computing models, and make some observations about their integration