Bio-steps beyond Turing

Bio-steps beyond Turing
复制标题

DOI:
10.1016/j.biosystems.2004.05.032
复制
发表时间:
2004-11-01
期刊:
影响因子:
1.6
通讯作者:
Paun, G
Paun, G
中科院分区:
生物学4区
文献类型:
--
作者:
Calude, CS;Paun, G

文献摘要

被引文献

相似文献

是否存在能够计算图灵不可计算函数的“生物计算代理”?用否定的答案来打发这个问题也许是诱人的。恰恰相反,在分子计算的文献中,我们第一次认为答案在理论上不是否定的。我们的结果将制定在膜计算(P系统)的语言。这里提出的一些数学结果本身就很有趣。与大多数基于非确定性的加速方法相比,我们的结果依赖于确定性P系统的一些普适性结果。这些结果将用于建立“加速P系统”。与图灵机的情况相反,加速是硬件的一部分(而不是环境的质量),它可以通过减少“反应器”的大小或通过加速通信信道来实现。因此,生物灵感的两个加速假设介绍,他们每个人都提出了具体的问题,生物学。最后,在本文的一个更具推测性的部分,我们将讨论大脑的图灵不可计算性活动和(外星)智能的可能形式。(C)2004爱思唯尔爱尔兰有限公司保留所有权利。
Are there 'biologically computing agents' capable to compute Turing uncomputable functions? It is perhaps tempting to dismiss this question with a negative answer. Quite the opposite, for the first time in the literature on molecular computing we contend that the answer is not theoretically negative. Our results will be formulated in the language of membrane computing (P systems). Some mathematical results presented here are interesting in themselves. In contrast with most speed-up methods which are based on non-determinism, our results rest upon some universality results proved for deterministic P systems. These results will be used for building "accelerated P systems". In contrast with the case of Turing machines, acceleration is a part of the hardware (not a quality of the environment) and it is realised either by decreasing the size of "reactors" or by speeding-up the communication channels. Consequently, two acceleration postulates of biological inspiration are introduced; each of them poses specific questions to biology. Finally, in a more speculative part of the paper, we will deal with Turing non-computability activity of the brain and possible forms of (extraterrestrial) intelligence. (C) 2004 Elsevier Ireland Ltd. All rights reserved.