A benchmark of instantaneous noise-based logic claims O(1) time for operations on exponentially large sets, but the speedup depends on free input encoding and fails against the authors' own classical algorithm.
Noise-based deterministic logic and computing: a brief survey
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
A short survey is provided about our recent explorations of the young topic of noise-based logic. After outlining the motivation behind noise-based computation schemes, we present a short summary of our ongoing efforts in the introduction, development and design of several noise-based deterministic multivalued logic schemes and elements. In particular, we describe classical, instantaneous, continuum, spike and random-telegraph-signal based schemes with applications such as circuits that emulate the brain's functioning and string verification via a slow communication channel.
citation-role summary
citation-polarity summary
fields
physics.gen-ph 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
"Quantum supremacy" challenged. Instantaneous noise-based logic with benchmark demonstrations
A benchmark of instantaneous noise-based logic claims O(1) time for operations on exponentially large sets, but the speedup depends on free input encoding and fails against the authors' own classical algorithm.