A look at the descriptional complexity of \(\mathrm{SNQ}\) \(\mathrm{P}\) systems

DOI10.1007/978-3-030-00265-7_18OpenAlexW2891048371MaRDI QIDQ1709916

Andrei Păun, Florin-Daniel Bîlbîe

Publication date: 15 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-00265-7_18

zbMATH Keywords

universalitydescriptional complexityregister machinesspiking neural networks\(\mathrm{P}\) systems

Mathematics Subject Classification ID

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

This page was built for publication: A look at the descriptional complexity of \(\mathrm{SNQ}\) \(\mathrm{P}\) systems