cs.NEOct 2, 2026

Small universal multiset reaction systems

Authors: Andrei Paun, Annemarie-Beatrix Messner

Organizations: Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania · National Institute of Research and Development for Biological Sciences, 296 Independent,ei Bd. District 6, 060031, Bucharest. Romania · Research Institute for Artificial Intelligence (ICIA), Romanian Academy, Bucharest, Romania.

Abstract

This paper presents a construction of a small universal machine within the framework of Multi-set Reaction Systems. We encode the machine state using elements that represent registers and instruction labels, and we enforce sequential execution by ensuring that reaction chains for a given instruction can only activate after the corresponding label element appears. We implement a universal register machine with 8 registers and 23 instructions, showing that the priority-based model requires 87 distinct elements. The results demonstrate that multiset reaction systems are capable of simulating universal computation.

Figures & tables

Explore similar work

CardsList
  1. SemML 2.0: Synthesizing Controllers for LTL

    Apr 27, 2026Jan Křetínský, Tobias Meggendorfer, Maximilian ProkopProgram SynthesisFormal Verification

  2. When Does Tool Use Increase the Expressive Power of Finite-Precision Recurrent Models?

    Jul 7, 2026Nikola Zubić, Qian Li, Yuyi Wang +1Recurrent Neural NetworksNeural Network Expressivity