On the complexity of occurrence and convergence problems in reaction systems

DOI10.1007/s11047-014-9456-3zbMath1390.68306OpenAlexW2019624322MaRDI QIDQ1646245

Enrico Formenti, Luca Manzoni, Antonio E. Porreca

Publication date: 25 June 2018

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-014-9456-3

zbMATH Keywords

computational complexitydiscrete dynamical systemsreaction systems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Minimal reaction systems: duration and blips ⋮ Evolvability of reaction systems and the invisibility theorem ⋮ A graph isomorphism condition and equivalence of reaction systems ⋮ Complexity of the dynamics of reaction systems ⋮ Plug-in context providers for reaction systems ⋮ Fixed points and attractors of reactantless and inhibitorless reaction systems ⋮ Unnamed Item ⋮ Facilitation in reaction systems ⋮ Simulation of reaction systems by the strictly minimal ones ⋮ Controllability of reaction systems ⋮ Asynchrony and persistence in reaction systems ⋮ Reaction systems with influence on environment ⋮ Communicating reaction systems with direct communication ⋮ Complexity of local, global and universality properties in finite dynamical systems ⋮ Minimal Reaction Systems Revisited and Reaction System Rank

Cites Work

• Minimal and almost minimal reaction systems
• Introducing time in reaction systems
• On the computational complexity of finite cellular automata
• FUNCTIONAL CONSTRUCTIONS BETWEEN REACTION SYSTEMS AND PROPOSITIONAL LOGIC
• SIMPLE REACTION SYSTEMS AND THEIR CLASSIFICATION
• Reaction Systems Made Simple
• Unnamed Item