Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Computational Complexity of Neuromorphic Algorithms

Conference ·

Neuromorphic computing has several characteristics that make it an extremely compelling computing paradigm for post Moore computation. Some of these characteristics include intrinsic parallelism, inherent scalability, collocated processing and memory, and event-driven computation. While these characteristics impart energy efficiency to neuromorphic systems, they do come with their own set of challenges. One of the biggest challenges in neuromorphic computing is to establish the theoretical underpinnings of the computational complexity of neuromorphic algorithms. In this paper, we take the first steps towards defining the space and time complexity of neuromorphic algorithms. Specifically, we describe a model of neuromorphic computation and state the assumptions that govern the computational complexity of neuromorphic algorithms. Next, we present a theoretical framework to define the computational complexity of a neuromorphic algorithm. We explicitly define what space and time complexities mean in the context of neuromorphic algorithms based on our model of neuromorphic computation. Finally, we leverage our approach and define the computational complexities of six neuromorphic algorithms: constant function, successor function, predecessor function, projection function, neuromorphic sorting algorithm and neighborhood subgraph extraction algorithm.

Research Organization:
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
Sponsoring Organization:
USDOE; USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)
DOE Contract Number:
AC05-00OR22725
OSTI ID:
1831643
Country of Publication:
United States
Language:
English

References (18)

Provable Neuromorphic Advantages for Computing Shortest Paths conference July 2020
Flexible organic field-effect transistor arrays for wearable neuromorphic device applications journal January 2020
Spike-based graph centrality measures conference July 2020
Rate coding vs. temporal coding - is optimum between? conference July 2016
Efficient Classification of Supercomputer Failures Using Neuromorphic Computing conference November 2018
Evolutionary Optimization for Neuromorphic Systems
  • Schuman, Catherine D.; Mitchell, J. Parker; Patton, Robert M.
  • NICE '20: Neuro-inspired Computational Elements Workshop, Proceedings of the Neuro-inspired Computational Elements Workshop https://doi.org/10.1145/3381755.3381758
conference June 2020
Non-Traditional Input Encoding Schemes for Spiking Neuromorphic Systems conference July 2019
Selecting a Proper Neuromorphic Platform for the Intelligent IoT conference October 2020
Solving a steady-state PDE using spiking networks and neuromorphic hardware conference July 2020
Neuromorphic Nearest Neighbor Search Using Intel's Pohoiki Springs conference March 2020
On the computational power and complexity of Spiking Neural Networks conference March 2020
Neuromorphic Graph Algorithms conference March 2020
Modeling epidemic spread with spike-based models conference July 2020
NeoN: Neuromorphic control for autonomous robotic navigation conference October 2017
Neural Population Coding for Effective Temporal Classification conference July 2019
Turing complete neural computation based on synaptic plasticity journal October 2019
The Super-Turing Computational Power of Plastic Recurrent Neural Networks journal November 2014
Shortest Path and Neighborhood Subgraph Extraction on a Spiking Memristive Neuromorphic Implementation conference January 2019

Similar Records

Computational Complexity of Neuromorphic Algorithms
Conference · 2021 · OSTI ID:2441128

Shortest Path and Neighborhood Subgraph Extraction on a Spiking Memristive Neuromorphic Implementation
Conference · 2019 · OSTI ID:1559663

Neuromorphic Graph Algorithms
Technical Report · 2021 · OSTI ID:1829422

Related Subjects