Sleptsov Nets are Turing-complete
Computational Complexity
2023-12-18 v2 Distributed, Parallel, and Cluster Computing
Abstract
The present paper proves that a Sleptsov net (SN) is Turing-complete, that considerably improves, with a brief construct, the previous result that a strong SN is Turing-complete. Remind that, unlike Petri nets, an SN always fires enabled transitions at their maximal firing multiplicity, as a single step, leaving for a nondeterministic choice of which fireable transitions to fire. A strong SN restricts nondeterministic choice to firing only the transitions having the highest firing multiplicity.
Cite
@article{arxiv.2306.12440,
title = {Sleptsov Nets are Turing-complete},
author = {Bernard Berthomieu and Dmitry A. Zaitsev},
journal= {arXiv preprint arXiv:2306.12440},
year = {2023}
}
Comments
Sleptsov Net Computing Resolves Modern Supercomputing Problems, https://technews.acm.org/archives.cfm?fo=2023-04-apr/apr-21-2023.html