Читать онлайн

The paper considers a new method for finding patterns in a chaotic system and an algorithm implementing it that automatically computes geometric, physical, and other possible interactions based on preferences between objects in a chaotic system in a reasonable computational time, selecting the only possible solution from the whole population. The algorithm has P-class simplicity in solving NP-class problems, bringing machine intelligence as close as possible to human intelligence. Descriptions of original solutions to a number of technical and creative problems are presented.

Ключевые фразы: Chaos, chaos sieve, combinatorial analysis, Euler graphs, traveling salesman problem, trans-computational problem, NP-class, P versus NP, preference matrix.
Автор (ы): Соловьев В. Г.
Журнал: The complex systems

Идентификаторы и классификаторы

УДК
519.6. Вычислительная математика, численный анализ и программирование (машинная математика)
Для цитирования:
СОЛОВЬЕВ В. Г. THE CHAOS SIEVE // THE COMPLEX SYSTEMS. 2020. № 4 (10)
Текстовый фрагмент статьи