Nonlinear computability based on chaos

G. Manganaro, J. Pineda de Gyvez

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
2 Downloads (Pure)

Abstract

Two new computing models based on information coding and chaotic dynamical systems are presented. The novelty of these models lies on the blending of chaos theory and information coding to solve complex combinatorial problems. A unique feature of our computing models is that despite the nonpredictability property of chaos, it is possible to solve any combinatorial problem in a systematic way, and with only one dynamical system. This is in sharp contrast to methods based on heuristics employing an array of chaotic cells. To prove the computing power and versatility of our models, we address the systematic solution of classical NP-complete problems such as the three colorability and the directed Hamiltonian path in addition to a new chaotic simulated annealing scheme.
Original languageEnglish
Pages (from-to)415-429
Number of pages15
JournalInternational Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Volume10
Issue number2
DOIs
Publication statusPublished - 2000

Fingerprint

Dive into the research topics of 'Nonlinear computability based on chaos'. Together they form a unique fingerprint.

Cite this