Editing Open Problems (section)

= Is stable computation decidable? =

=== Context ===
In order for a CRN to have a deterministic output (for given input), the CRN should stably compute. The question is whether this property is decidable for CRNs.

=== Problem overview ===
See the definition of stably computes from problem "CRNs and circuit complexity" above. The question is this: Is it decidable whether or not a given CRN stably computes? 

So, is it decidable whether for any configuration $\vec{c}$ reachable from an initial configuration, there is a configuration $\vec{o}$ reachable from $\vec{c}$ such that:
<ul>
<li> configuration $\vec{o}$ has a $Y$ (yes) species present and no $N$ (no) species present, or vice versa, and
<li> this property holds for all configurations reachable from $\vec{o}$?
</ul>

=== Interested Participants ===

* [[User:Brijder | Robert Brijder ]]
* [[User:Doty | Dave Doty ]]