• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

Computational properties of self-reproducing growing automata.

作者信息

Sosic R, Johnson R R

机构信息

School of Computing and Information Technology, Griffith University, Nathan, QLD, Australia.

出版信息

Biosystems. 1995;36(1):7-17. doi: 10.1016/0303-2647(95)01523-n.

DOI:10.1016/0303-2647(95)01523-n
PMID:8527697
Abstract

Living organisms perform much better than computers at solving complex, irregular computational tasks, like search and adaptation. Key features of living organisms, identified in the paper as a basis for their success in solving complex problems, are: self-reproduction of cells, flexible framework, and modification. These key features of living organisms are abstracted into a computational model, called growing automata. Growing automata are suited for extremely large computational problems, such as search problems. Growing automata are representatives of soft machines. Soft machines can change their physical structure as opposed to hard machines which have fixed structure. An example of a soft machine is a living organism, an example of a hard machine is an electronic computer. The computational properties of soft and hard machines are analyzed and compared. An analysis of growing automata demonstrates their advantages, as well as their limitations as compared to hard machines.

摘要

相似文献

1
Computational properties of self-reproducing growing automata.
Biosystems. 1995;36(1):7-17. doi: 10.1016/0303-2647(95)01523-n.
2
Minimizing complexity in cellular automata models of self-replication.
Proc Int Conf Intell Syst Mol Biol. 1993;1:337-44.
3
How Chemistry Computes: Language Recognition by Non-Biochemical Chemical Automata. From Finite Automata to Turing Machines.化学如何进行计算:非生化化学自动机的语言识别。从有限自动机到图灵机。
iScience. 2019 Sep 27;19:514-526. doi: 10.1016/j.isci.2019.08.007. Epub 2019 Aug 7.
4
Reliable self-replicating machines in asynchronous cellular automata.异步细胞自动机中的可靠自我复制机器。
Artif Life. 2007 Fall;13(4):397-413. doi: 10.1162/artl.2007.13.4.397.
5
SELF-REPRODUCING AUTOMATA.
Perspect Biol Med. 1965;8:373-93. doi: 10.1353/pbm.1965.0037.
6
An Ansatz for Computational Undecidability in RNA Automata.RNA 自动机计算不可判定性的一种方法。
Artif Life. 2023 May 1;29(2):261-288. doi: 10.1162/artl_a_00370.
7
Adaptive properties of living beings: proposal for a generic mechanism. (Self-programming machines III).生物的适应性特性:一种通用机制的提议。(自我编程机器III)
C R Biol. 2006 Mar;329(3):137-47. doi: 10.1016/j.crvi.2005.12.002. Epub 2006 Jan 18.
8
Artificial life simulation of self-assembly in bacteriophage by movable finite automata.
Biosystems. 2004 Nov;77(1-3):151-61. doi: 10.1016/j.biosystems.2004.05.027.
9
Self-description for construction and computation on graph-rewriting automata.关于图重写自动机的构造与计算的自我描述。
Artif Life. 2007 Fall;13(4):383-96. doi: 10.1162/artl.2007.13.4.383.
10
Molecular automata assembly: principles and simulation of bacterial membrane construction.分子自动机组装:细菌膜构建的原理与模拟
Biosystems. 1997;44(3):209-29. doi: 10.1016/s0303-2647(97)00048-8.