arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.02637cs.DCcs.ET
收藏

离散化学反应网络的可组合计算

Composable computation in discrete chemical reaction networks

Eric E. Severson, David Haley, David Doty

摘要:

我们研究了稳定计算的离散化学反应网络(CRN)的可组合性(即,错误概率为0)整数值函数$f:\mathbb{N}^d\to\mathbb{N}$。我们考虑输出不经意的CRN,其中输出物质永远不是任何反应的反应物(输入)。输出无关CRN类是基本的,出现在CRN计算的早期研究中,因为它正是可以通过简单地重命名上游CRN的输出以匹配下游CRN的输入来组成的CRN类。我们的主要定理精确地刻画了函数$f$可由具有初始领导者的输出无关CRN稳定计算。关键的必要条件是,对于足够大的输入,$f$是最小的有限数量的非减少quilt-affine函数。(An仿射函数是具有恒定偏移的线性函数;面组仿射函数是具有周期性偏移的线性函数)。

英文摘要:

We study the composability of discrete chemical reaction networks (CRNs) that stably compute (i.e., with probability 0 of error) integer-valued functions $f:\mathbb{N}^d\to\mathbb{N}$. We consider output-oblivious CRNs in which the output species is never a reactant (input) to any reaction. The class of output-oblivious CRNs is fundamental, appearing in earlier studies of CRN computation, because it is precisely the class of CRNs that can be composed by simply renaming the output of the upstream CRN to match the input of the downstream CRN. Our main theorem precisely characterizes the functions $f$ stably computable by output-oblivious CRNs with an initial leader. The key necessary condition is that for sufficiently large inputs, $f$ is the minimum of a finite number of nondecreasing quilt-affine functions. (An affine function is linear with a constant offset; a quilt-affine function is linear with a periodic offset).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑