Universal Sleptsov net

DOI10.1080/00207160.2017.1283410zbMATH Open1397.68127OpenAlexW2574822115MaRDI QIDQ3177465FDOQ3177465

Dmitry A. Zaitsev

Publication date: 25 July 2018

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2017.1283410

Recommendations

• scientific article; zbMATH DE number 7357525
• Small universal networks of evolutionary processors
• Universal Petri net
• Small Weakly Universal Turing Machines
• Four Small Universal Turing Machines

zbMATH Keywords

polynomial complexityTuring machinePetri netmultiple firinguniversal Sleptsov net

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Small Weakly Universal Turing Machines
• Title not available (Why is that?)
• On the Computational Complexity of Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• P-completeness of Cellular Automaton Rule 110
• On the computational complexity of spiking neural P systems
• State equations and equivalent transformations for timed Petri nets
• Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
• Universal Petri net

Cited In (1)

• GPU based virtual machine for Sleptsov net computing

Uses Software

• TINA

This page was built for publication: Universal Sleptsov net

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