Computing with Spiking Neural P Systems: Traces and Small Universal Systems

DOI10.1007/11925903_1MaRDI QIDQ5452557zbMATH OpenOpenAlexFDO

Authors Mihai Ionescu, Andrei Păun, Gheorghe Păun, Mario J. Pérez-Jiménez

Publication date 4 April 2008

Published in DNA Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11925903_1

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Smaller universal spiking neural P systems
• On trace languages generated by (small) spiking neural P systems
• SPIKE TRAINS IN SPIKING NEURAL P SYSTEMS
• Spiking neural P systems
• Three small universal spiking neural P systems

Cited in

(14)

• Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons
• An error-tolerant serial binary full-adder via a spiking neural P system using HP/LP basic neurons
• Small SNQ P systems with multiple types of spikes
• Novel systematic mathematical computation based on the spiking frequency gate (SFG): innovative organization of spiking computer
• On trace languages generated by (small) spiking neural P systems
• Smaller universal spiking neural P systems
• How Redundant Is Your Universal Computation Device?
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• Asynchronous Spiking Neural P Systems: Decidability and Undecidability
• SPIKE TRAINS IN SPIKING NEURAL P SYSTEMS
• A note on small universal spiking neural P systems
• Spiking neural P systems: main ideas and results
• A weakly universal spiking neural P system
• Computing along the axon

This page was built for publication: Computing with Spiking Neural P Systems: Traces and Small Universal Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452557)