更改

[[Image:Nobili Pesavento 2reps.png|right|thumb|400px|The first implementation of von Neumann's self-reproducing universal constructor.<ref name=Pesavento1995>{{Citation|journal=Artificial Life| title=An implementation of von Neumann's self-reproducing machine| year=1995| first=Umberto| last=Pesavento|volume=2|issue=4|pages=337–354|publisher=MIT Press|url=http://dragonfly.tam.cornell.edu/~pesavent/pesavento_self_reproducing_machine.pdf|archive-url=https://web.archive.org/web/20070621164824/http://dragonfly.tam.cornell.edu/~pesavent/pesavento_self_reproducing_machine.pdf |archive-date=June 21, 2007 |doi=10.1162/artl.1995.2.337|pmid=8942052}}</ref> Three generations of machine are shown: the second has nearly finished constructing the third. The lines running to the right are the tapes of genetic instructions, which are copied along with the body of the machines. The machine shown runs in a 32-state version of von Neumann's cellular automata environment, not his original 29-state specification.

[[Image:Nobili Pesavento 2reps.png|right|thumb|400px|The first implementation of von Neumann's self-reproducing universal constructor.<ref name=Pesavento1995>{{Citation|journal=Artificial Life| title=An implementation of von Neumann's self-reproducing machine| year=1995| first=Umberto| last=Pesavento|volume=2|issue=4|pages=337–354|publisher=MIT Press|url=http://dragonfly.tam.cornell.edu/~pesavent/pesavento_self_reproducing_machine.pdf|archive-url=https://web.archive.org/web/20070621164824/http://dragonfly.tam.cornell.edu/~pesavent/pesavento_self_reproducing_machine.pdf |archive-date=June 21, 2007 |doi=10.1162/artl.1995.2.337|pmid=8942052}}</ref> Three generations of machine are shown: the second has nearly finished constructing the third. The lines running to the right are the tapes of genetic instructions, which are copied along with the body of the machines. The machine shown runs in a 32-state version of von Neumann's cellular automata environment, not his original 29-state specification.

 

'''''【终译版】'''''冯 · 诺依曼的自复制通用构造函数的第一个实例。三个机器如图所示: 第二个即将构造完第三个。右边的线条是遗传指令的磁带，这些磁带随着机器的身体一起被复制。所展示的机器运行在32态的冯 · 诺依曼元胞自动机环境中，而非他最初的29态规则。]]

 

'''''【终译版】'''''冯 · 诺依曼的自复制通用构造函数的第一个实现。显示了三代机器：第二代已基本完成第三代的构建。向右延伸的线条是遗传指令的磁带，它们与机器的主体一起被复制。显示的机器在冯诺依曼的元胞自动机环境的 32 状态版本中运行，而不是他最初的 29 状态规范。]]

[[John von Neumann]]'s '''universal constructor''' is a [[self-replicating machine]] in a [[cellular automata]] (CA) environment. It was designed in the 1940s, without the use of a computer. The fundamental details of the machine were published in von Neumann's book ''Theory of Self-Reproducing Automata'', completed in 1966 by [[Arthur Burks|Arthur W. Burks]] after von Neumann's death.<ref name=TSRA>{{Citation| url=https://archive.org/details/theoryofselfrepr00vonn_0| title=''Theory of Self-Reproducing Automata.''| author1=von Neumann, John| author2=Burks, Arthur W.| year=1966| publisher=University of Illinois Press| format=Scanned book online| archive-date=2015-06-24| access-date=2017-02-28}}</ref> While typically not as well known as von Neumann's other work, it is regarded as foundational for [[automata theory]], [[complex systems]], and [[artificial life]].<ref name=McMullin2000>{{Citation|journal=Artificial Life|last=McMullin|first=B.|year=2000|title=John von Neumann and the Evolutionary Growth of Complexity: Looking Backwards, Looking Forwards...|volume=6|issue=4|pages=347–361|url=http://www.eeng.dcu.ie/~alife/bmcm-alj-2000/|doi=10.1162/106454600300103674|pmid=11348586|s2cid=5454783}}</ref><ref name=Rocha1998>{{Citation|journal=Evolutionary Systems| title=Selected self-organization and the semiotics of evolutionary systems| year=1998| first=Luis M.| last=Rocha|pages=341–358|publisher=Springer, Dordrecht| doi=10.1007/978-94-017-1510-2_25| isbn=978-90-481-5103-5|url=https://link.springer.com/chapter/10.1007/978-94-017-1510-2_25}}</ref> Indeed, Nobel Laureate [[Sydney Brenner]] considered Von Neumann's work on self-reproducing automata (together with [[Turing]]'s work on computing machines) central to [[biological theory]] as well, allowing us to "discipline our thoughts about machines, both natural and artificial."<ref name=Brenner2012>{{Citation|journal=Nature| title=Life's code script| year=2012| first=Sydney| last=Brenner|volume=482| issue=7386|pages=461|url=https://www.nature.com/articles/482461a|doi=10.1038/482461a|pmid=22358811| s2cid=205070101}}</ref>

[[John von Neumann]]'s '''universal constructor''' is a [[self-replicating machine]] in a [[cellular automata]] (CA) environment. It was designed in the 1940s, without the use of a computer. The fundamental details of the machine were published in von Neumann's book ''Theory of Self-Reproducing Automata'', completed in 1966 by [[Arthur Burks|Arthur W. Burks]] after von Neumann's death.<ref name=TSRA>{{Citation| url=https://archive.org/details/theoryofselfrepr00vonn_0| title=''Theory of Self-Reproducing Automata.''| author1=von Neumann, John| author2=Burks, Arthur W.| year=1966| publisher=University of Illinois Press| format=Scanned book online| archive-date=2015-06-24| access-date=2017-02-28}}</ref> While typically not as well known as von Neumann's other work, it is regarded as foundational for [[automata theory]], [[complex systems]], and [[artificial life]].<ref name=McMullin2000>{{Citation|journal=Artificial Life|last=McMullin|first=B.|year=2000|title=John von Neumann and the Evolutionary Growth of Complexity: Looking Backwards, Looking Forwards...|volume=6|issue=4|pages=347–361|url=http://www.eeng.dcu.ie/~alife/bmcm-alj-2000/|doi=10.1162/106454600300103674|pmid=11348586|s2cid=5454783}}</ref><ref name=Rocha1998>{{Citation|journal=Evolutionary Systems| title=Selected self-organization and the semiotics of evolutionary systems| year=1998| first=Luis M.| last=Rocha|pages=341–358|publisher=Springer, Dordrecht| doi=10.1007/978-94-017-1510-2_25| isbn=978-90-481-5103-5|url=https://link.springer.com/chapter/10.1007/978-94-017-1510-2_25}}</ref> Indeed, Nobel Laureate [[Sydney Brenner]] considered Von Neumann's work on self-reproducing automata (together with [[Turing]]'s work on computing machines) central to [[biological theory]] as well, allowing us to "discipline our thoughts about machines, both natural and artificial."<ref name=Brenner2012>{{Citation|journal=Nature| title=Life's code script| year=2012| first=Sydney| last=Brenner|volume=482| issue=7386|pages=461|url=https://www.nature.com/articles/482461a|doi=10.1038/482461a|pmid=22358811| s2cid=205070101}}</ref>

= 目的  =  

= 目的  =  

[[File:Von Neuman Self-replication 2.jpg|thumb|400px|right|Von Neumann's System of Self-Replication Automata with the ability to evolve (Figure adapted from [[Luis M. Rocha|Luis Rocha]]'s Lecture Notes at Indiana University<ref name=Rocha_lec_notes>{{citation |last=Rocha|first=Luis M.| year=2015 |title=Lecture Notes of I-485-Biologically Inspired Computing Course, Indiana University|chapter=Chapter 6. Von Neumann and Natural Selection.|chapter-url=https://homes.luddy.indiana.edu/rocha/academics/i-bic/pdfs/ibic_lecnotes_c6.pdf|url=https://homes.luddy.indiana.edu/rocha/academics/i-bic/pdfs/ibic_lecnotes.pdf}}</ref>). i) the self-replicating system is composed of several automata plus a separate description (an encoding formalized as a [[Turing Machine|Turing 'tape']]) of all the automata: Universal Constructor (A), Universal Copier (B), Operating System (C), extra functions not involved with replication (D), and separate description Φ(A,B,C,D) encoding all automata. ii) (Top) Universal Constructor produces (decodes) automata from their description (''active'' mode of description); (Bottom) Universal Copier copies description of automata (''passive'' mode of description); Mutations Φ(D') to description Φ(D) (not changes in automaton D directly) propagate to the set of automata produced in next generation, allowing (automata + description) system to continue replicating and evolving (D → D').<ref name=Rocha1998/> The active process of construction from a description parallels [[Translation (biology)|DNA translation]], the passive process of copying the description parallels [[DNA replication]], and inheritance of mutated descriptions parallels [[Mutation|Vertical inheritance of DNA mutations]] in Biology,<ref name=Rocha1998/><ref name=Brenner2012/> and were proposed by Von Neumann before the discovery of the structure of the DNA molecule and how it is separately translated and replicated in the Cell.<ref name=Rocha_lec_notes/>'''''【终译版】'''''Von Neumann 的具有进化能力的自我复制自动机系统（图改编自Luis Rocha在印第安纳大学的讲义）。i) 自我复制系统由几个自动机加上所有自动机的单独描述（形式化为图灵“磁带”的编码）组成：通用构造器（A），通用复印机（B），操作系统（C），不涉及复制的额外功能 (D)，以及编码所有自动机的单独描述 Φ(A,B,C,D)。ii）（上）通用构造函数从它们的描述中产生（解码）自动机（描述的''主动''模式）；（下）Universal Copier 复制自动机的描述（''被动''描述方式）；突变 Φ(D') 到描述 Φ(D)（不是自动机 D 的直接变化）传播到下一代产生的自动机集合，允许（自动机 + 描述）系统继续复制和进化（D → D'）。从描述构建的主动过程与DNA 翻译相似，复制描述的被动过程与DNA 复制相似，突变描述的继承与生物学中 DNA 突变的垂直继承相似，由冯诺依曼在发现 DNA 分子的结构以及它如何在细胞中单独翻译和复制之前。|链接=Special:FilePath/Von_Neuman_Self-replication_2.jpg]]

[[File:Von Neuman Self-replication 2.jpg|thumb|400px|right|Von Neumann's System of Self-Replication Automata with the ability to evolve (Figure adapted from [[Luis M. Rocha|Luis Rocha]]'s Lecture Notes at Indiana University<ref name=Rocha_lec_notes>{{citation |last=Rocha|first=Luis M.| year=2015 |title=Lecture Notes of I-485-Biologically Inspired Computing Course, Indiana University|chapter=Chapter 6. Von Neumann and Natural Selection.|chapter-url=https://homes.luddy.indiana.edu/rocha/academics/i-bic/pdfs/ibic_lecnotes_c6.pdf|url=https://homes.luddy.indiana.edu/rocha/academics/i-bic/pdfs/ibic_lecnotes.pdf}}</ref>). i) the self-replicating system is composed of several automata plus a separate description (an encoding formalized as a [[Turing Machine|Turing 'tape']]) of all the automata: Universal Constructor (A), Universal Copier (B), Operating System (C), extra functions not involved with replication (D), and separate description Φ(A,B,C,D) encoding all automata. ii) (Top) Universal Constructor produces (decodes) automata from their description (''active'' mode of description); (Bottom) Universal Copier copies description of automata (''passive'' mode of description); Mutations Φ(D') to description Φ(D) (not changes in automaton D directly) propagate to the set of automata produced in next generation, allowing (automata + description) system to continue replicating and evolving (D → D').<ref name=Rocha1998/> The active process of construction from a description parallels [[Translation (biology)|DNA translation]], the passive process of copying the description parallels [[DNA replication]], and inheritance of mutated descriptions parallels [[Mutation|Vertical inheritance of DNA mutations]] in Biology,<ref name=Rocha1998/><ref name=Brenner2012/> and were proposed by Von Neumann before the discovery of the structure of the DNA molecule and how it is separately translated and replicated in the Cell.<ref name=Rocha_lec_notes/>'''''【终译版】'''''冯·诺依曼的具有进化能力的自复制自动机系统（图改编自路易斯·罗查在印第安纳大学的讲稿）。i） 自复制系统包含几个自动机加上所有自动机的单独“描述文件”（形式为图灵“磁带”编码）：通用构造模块（A）、通用复印模块（B）、操作系统模块（C）、与复制无关的额外功能模块（D）以及对所有自动机编码的单独“描述文件”Φ（A、B、C、D）。ii）（顶部）通用构造模块根据其“描述文件”生成（解码）自动机（描述的活动模式）；（底部）通用复印模块复制自动机“描述文件”（被动描述模式）；从Φ（D'）到描述Φ（D）的突变（不是自动机D中的直接变化）传播到下一代产生的自动机上，允许（自动机各模块+“描述文件”）系统继续复制和进化（D→ D'）。“描述文件”的主动构建过程与DNA翻译对应，复制“描述文件”的被动过程与DNA复制对应，突变“描述文件”的遗传与生物学中DNA突变的垂直遗传对应，在发现DNA分子的结构以及DNA分子在细胞中如何被分别翻译和复制之前，冯·诺依曼就已经提出了这一观点。|链接=Special:FilePath/Von_Neuman_Self-replication_2.jpg]]

Von Neumann's design has traditionally been understood to be a demonstration of the logical requirements for machine self-replication.<ref name=McMullin2000/> However, it is clear that far simpler machines can achieve self-replication. Examples include trivial [[Crystal growth|crystal-like growth]], [[template replication]], and [[Langton's loops]]. But von Neumann was interested in something more profound: construction, universality, and evolution.<ref name=Rocha1998/><ref name=Brenner2012/>

Von Neumann's design has traditionally been understood to be a demonstration of the logical requirements for machine self-replication.<ref name=McMullin2000/> However, it is clear that far simpler machines can achieve self-replication. Examples include trivial [[Crystal growth|crystal-like growth]], [[template replication]], and [[Langton's loops]]. But von Neumann was interested in something more profound: construction, universality, and evolution.<ref name=Rocha1998/><ref name=Brenner2012/>

[[Image:Pesavento replicator inherited mutations.png|thumb|center|700px|A demonstration of the ability of von Neumann's machine to support inheritable mutations. (1) At an earlier timestep, a mutation was manually added to the second generation machine's tape. (2) Later generations both display the [[phenotype]] of the mutation (a drawing of a flower) and pass the mutation on to their children, since the tape is copied each time. This example illustrates how von Neumann's design allows for complexity growth (in theory) since the tape could specify a machine that is more complex than the one making it.

[[Image:Pesavento replicator inherited mutations.png|thumb|center|700px|A demonstration of the ability of von Neumann's machine to support inheritable mutations. (1) At an earlier timestep, a mutation was manually added to the second generation machine's tape. (2) Later generations both display the [[phenotype]] of the mutation (a drawing of a flower) and pass the mutation on to their children, since the tape is copied each time. This example illustrates how von Neumann's design allows for complexity growth (in theory) since the tape could specify a machine that is more complex than the one making it.

'''''【终译版】'''''冯诺依曼机器支持可遗传突变的能力的演示。(1) 在较早的时间步，一个突变被手动添加到第二代机器的磁带中。(2) 后代都显示突变的表型（一朵花的图画）并将突变传给他们的孩子，因为每次都复制磁带。这个例子说明了冯诺依曼的设计如何允许复杂性增长（理论上），因为磁带可以指定一台比制造它的机器更复杂的机器。|链接=Special:FilePath/Pesavento_replicator_inherited_mutations.png]]

'''''【终译版】'''''冯诺依曼机器支持可遗传突变的演示。(1) 在较早的时间步，一个突变被手动添加到第二代机器的磁带中。(2) 后代都显示突变的表型（一朵花的图画）并将突变传给他们的孩子，因为每次都复制磁带。这个例子说明了冯诺依曼的设计如何允许复杂性增长（理论上），因为磁带可以描述一台比制造它的机器更复杂的机器。|链接=Special:FilePath/Pesavento_replicator_inherited_mutations.png]]

== Implementations ==

== Implementations ==

2007年，Nobili 发布了一个包含32个州的实现方案，该方案使用游程编码来大大减小磁带的大小。

2007年，Nobili 发布了一个包含32个州的实现方案，该方案使用游程编码来大大减小磁带的大小。

'''''【终译版】'''''2007 年，Nobili 发布了一个 32 态规则的实例，它使用游程编码来大大减小磁带的大小。<ref name="nobili2007" />

'''''【终译版】'''''2007 年，Nobili 发布了一个 32 态规则的实例，它使用游程编码来大大减小磁带的大小。<ref name="nobili2007" />

|-

|-

! Nobili-Pesavento, 1995<ref name=Pesavento1995/>

! Nobili-Pesavento, 1995<ref name=Pesavento1995/>

| {{CEmpty}}<ref>{{cite web|url=http://www.sq3.org.uk/wiki.pl?Von_Neumann%27s_Self-Reproducing_Universal_Constructor|title=Von Neumann's Self-Reproducing Universal Constructor}}</ref> || Nobili 32-state || 97&nbsp;×&nbsp;170 || 6,329 || 145,315 || 22.96 || 6.34{{times}}10¹⁰ || {{CNone|none}} || 5 bits || binary || holistic constructor || {{no2|non-repeatable}} || linear

| {{CEmpty}}<ref name=":4">{{cite web|url=http://www.sq3.org.uk/wiki.pl?Von_Neumann%27s_Self-Reproducing_Universal_Constructor|title=Von Neumann's Self-Reproducing Universal Constructor}}</ref>|| Nobili 32-state || 97&nbsp;×&nbsp;170 || 6,329 || 145,315 || 22.96 || 6.34{{times}}10¹⁰ || {{CNone|none}} || 5 bits || binary || holistic constructor || {{no2|non-repeatable}} || linear

|-

|-

! Nobili, 2007

! Nobili, 2007

!增长率

!增长率

|-

|-

!诺比利-佩萨文托，1995  

!诺比利-佩萨文托，1995<ref name="Pesavento1995" />

|

|<ref name=":4" />

|诺比利 32 态

|诺比利 32 态

|97 × 170

|97 × 170

|二进制

|二进制

|整体构造器

|整体构造器

|可重复的

|可重复

|超线性

|超线性

|-

|-

|13.21

|13.21

|5.87  ×  10 ⁹

|5.87  ×  10 ⁹

|自动回缩

|自动回退

|5 位

|5 位

|二进制

|二进制

|整体构造器

|整体构造器

|可重复的

|可重复

|线性

|线性

|-

|-

!巴克利，2008  

!巴克利，2008<ref name="Automata2008" />

|replicator.mc

|replicator.mc

|冯诺依曼 29 态

|冯诺依曼 29 态

|15.86

|15.86

|2.61  ×  10 ¹¹

|2.61  ×  10 ¹¹

|自动回缩

|自动回退

|5 位

|5 位

|二进制

|二进制

|整体构造器

|整体构造器

|可重复的

|可重复

|线性

|线性

|-

|-

|二进制

|二进制

|整体构造器

|整体构造器

|可重复的

|可重复

|线性

|线性

|-

|-

|4.86

|4.86

|1.63  ×  10 ⁹

|1.63  ×  10 ⁹

|自动撤回/位生成/代码覆盖

|自动回退/位生成/代码覆盖

|3 位

|3 位

|二进制

|二进制

|整体构造器

|整体构造器

|可重复的

|可重复

|超线性

|超线性

|-

|-

|2063 × 377

|2063 × 377

|264,321

|264,321

|不适用

|无

|—

|—

|≈1.12  ×  10 ¹⁴

|≈1.12  ×  10 ¹⁴

|二进制

|二进制

|部分构造器

|部分构造器

|可重复的

|可重复

|线性

|线性

|-

|-

|2.25

|2.25

|—

|—

|自动撤回/位生成/代码覆盖/运行长度限制

|自动回退/位生成/代码覆盖/运行长度限制

|3+ 位

|3+ 位

|三元

|三进制

|整体构造器

|整体构造器

|可重复的

|可重复

|超线性

|超线性

|}

|}