Tag: P versus NP problem

An Efficient Combined Meta-Heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important NP-hard Problems and probably the most famous and extensively studied problem in the field of combinatorial optimization. In this problem, a salesman is required to visit each of n given nodes once and only once, starting from any node and returning

Man versus Computer: Difference of the Essences. The Problem of the Scientific Creation

In this study it is proposed the critical analysis of the creation of Artificial Intelligence (AI) and of Artificial General Intelligence (AGI). The unity of formal logic and rational dialectics is the methodological basis of the analysis. The main results of the analysis are as follows: (1) the model of