Papers › Sensitivity of a Chaotic Logic Gate
Sensitivity of a Chaotic Logic Gate
Noeloikeau Charlot, Daniel J. Gauthier
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Chaotic logic gates or `chaogates' are a promising mixed-signal approach to designing universal computers. However, chaotic systems are exponentially sensitive to small perturbations, and the effects of noise can cause chaotic computers to fail. Here, we examine the sensitivity of a simulated chaogate to noise and other parameter variations (such as differences in supply voltage). We find that the regions in parameter space corresponding to chaotic dynamics coincide with the regions of maximum error in the computation. Further, this error grows exponentially within 4-10 iterations of the chaotic map. As such, we discuss the fundamental limitations of chaotic computing, and suggest potential improvements. Our Python simulation methods are open-source and available at https://github.com/Noeloikeau/chaogate.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections