35
个编辑
更改
跳到导航
跳到搜索
第21行：
第21行： − + 第29行：
第29行： − + 第37行：
第37行： − + 第51行：
第51行： − + 第91行：
第91行： − − − − {{Quote − |text=Turing invented the stored-program computer, and von Neumann showed that the description is separate from the universal constructor. This is not trivial. Physicist Erwin Schrödinger confused the program and the constructor in his 1944 book What is Life?, in which he saw chromosomes as ″architect's plan and builder's craft in one″. This is wrong. The code script contains only a description of the executive function, not the function itself.<ref name=Brenner2012/> − |author=[[Sydney Brenner]] − }} − − === Evolution of Complexity === − + 第121行：
第112行： − + + + − = = 实现 = = + − 第196行：
第188行： − + 第394行：
第386行： − − 第415行：
第405行： − + − − − − − − − − 第429行：
第411行： − + 第438行：
第420行： − *Codd's cellular automaton+ − *Langton's loops − *Nobili cellular automata − *Quine, a program that produces itself as output − *Santa Claus machine − *Wireworld − *Constructor theory − − 这个程序把自己产生为输出圣诞老人机器线世界构造理论 − − 第462行：
第434行： + +
V0.21_20220109
约翰·冯·诺伊曼的通用构造器是细胞自动机(CA)环境中的自我复制机械。它是在20世纪40年代设计的，当时没有使用计算机。机器的基本细节发表在冯 · 诺依曼的《自复制自动机理论》一书中，该书由冯 · 诺依曼死后的亚瑟 · w · 伯克斯于1966年完成。虽然通常不像冯 · 诺依曼的其他著作那样广为人知，但它被认为是自动机理论、复杂系统和人工生命的基础。事实上，诺贝尔奖获得者悉尼 · 布伦纳认为冯 · 诺依曼关于自我复制自动机的工作(以及图灵关于计算机的工作)对生物学理论同样重要，它允许我们“约束我们关于自然和人工机器的思想”。
约翰·冯·诺伊曼的通用构造器是细胞自动机(CA)环境中的自我复制机械。它是在20世纪40年代设计的，当时没有使用计算机。机器的基本细节发表在冯 · 诺依曼的《自复制自动机理论》一书中，该书由冯 · 诺依曼死后的亚瑟 · w · 伯克斯于1966年完成。虽然通常不像冯 · 诺依曼的其他著作那样广为人知，但它被认为是自动机理论、复杂系统和人工生命的基础。事实上，诺贝尔奖获得者悉尼 · 布伦纳认为冯 · 诺依曼关于自我复制自动机的工作(以及图灵关于计算机的工作)对生物学理论同样重要，它允许我们“约束我们关于自然和人工机器的思想”。
'''''【终译版】'''''约翰·冯·诺依曼（John von Neumann）的'''通用构造器'''是一个细胞自动机(CA)环境中的自我复制结构。它是在20世纪40年代没有使用计算机的情况下设计的。自动机的基本细节发表在了冯·诺依曼的著作''《自复制自动机理论》中，''该书由亚瑟 · 伯克斯（Arthur W. Burks）于冯·诺依曼去世后的1966 年完成。虽然自复制自动机不像冯诺依曼的其他成就那样广为人知，但它被认为是自动机理论（automata theory）、复杂系统（complex systems）和人工生命的基础。并且，诺贝尔奖得主悉尼布伦纳（Sydney Brenner）认为冯诺依曼提出的自复制自动机（以及计算机）也是生物学理论的核心，让我们能够梳理我们对自然和人造机器的认识。
'''''【终译版】'''''约翰·冯·诺依曼（John von Neumann）的'''通用构造器'''是一个细胞自动机(CA)环境中的自我复制结构。它是在20世纪40年代没有使用计算机的情况下设计的。自动机的基本细节发表在了冯·诺依曼的著作''《自复制自动机理论》中，''该书由亚瑟 · 伯克斯（Arthur W. Burks）于冯·诺依曼去世后的1966 年完成。<ref name="TSRA" />虽然自复制自动机不像冯诺依曼的其他成就那样广为人知，但它被认为是自动机理论（automata theory）、复杂系统（complex systems）和人工生命的基础。<ref name="McMullin2000" /><ref name="Rocha1998" />并且，诺贝尔奖得主悉尼布伦纳（Sydney Brenner）认为冯诺依曼提出的自复制自动机（以及计算机）也是生物学理论的核心，让我们能够梳理我们对自然和人造机器的认识。<ref name="Brenner2012" />
Von Neumann's goal, as specified in his lectures at the University of Illinois in 1949,<ref name="TSRA"/> was to design a machine whose complexity could grow automatically akin to biological organisms under [[Natural Selection|natural selection]]. He asked what is the ''threshold of complexity'' that must be crossed for machines to be able to evolve.<ref name=Rocha1998/> His answer was to specify an abstract machine which, when run, would replicate itself. In his design, the self-replicating machine consists of three parts: a "description" of ('blueprint' or program for) itself, a ''universal constructor'' mechanism that can read any description and construct the machine (sans description) encoded in that description, and a ''universal copy machine'' that can make copies of any description. After the universal constructor has been used to construct a new machine encoded in the description, the copy machine is used to create a copy of that description, and this copy is passed on to the new machine, resulting in a working replication of the original machine that can keep on reproducing. Some machines will do this backwards, copying the description and then building a machine. Crucially, the self-reproducing machine can evolve by accumulating mutations of the description, not the machine itself, thus gaining the ability to grow in complexity.<ref name=Rocha1998/><ref name=Brenner2012/>
Von Neumann's goal, as specified in his lectures at the University of Illinois in 1949,<ref name="TSRA"/> was to design a machine whose complexity could grow automatically akin to biological organisms under [[Natural Selection|natural selection]]. He asked what is the ''threshold of complexity'' that must be crossed for machines to be able to evolve.<ref name=Rocha1998/> His answer was to specify an abstract machine which, when run, would replicate itself. In his design, the self-replicating machine consists of three parts: a "description" of ('blueprint' or program for) itself, a ''universal constructor'' mechanism that can read any description and construct the machine (sans description) encoded in that description, and a ''universal copy machine'' that can make copies of any description. After the universal constructor has been used to construct a new machine encoded in the description, the copy machine is used to create a copy of that description, and this copy is passed on to the new machine, resulting in a working replication of the original machine that can keep on reproducing. Some machines will do this backwards, copying the description and then building a machine. Crucially, the self-reproducing machine can evolve by accumulating mutations of the description, not the machine itself, thus gaining the ability to grow in complexity.<ref name=Rocha1998/><ref name=Brenner2012/>
1949年，冯 · 诺依曼在伊利诺伊大学厄巴纳-香槟分校的演讲中明确指出，他的目标是设计一种机器，其复杂性可以自动增长，类似于自然选择下的生物有机体。他问，机器要想进化，必须跨越多大的复杂性门槛。他的答案是指定一个抽象的机器，当运行时，它会自我复制。在他的设计中，自我复制机械包括3个部分: 一个对(‘蓝图’或程序)本身的“描述”，一个可以读取任何描述并构造机器的通用构造机制(无描述) ，以及一个可以复制任何描述的通用复印机。在使用通用构造函数构造描述中编码的新机器之后，使用复制机器创建描述的副本，并将该副本传递给新机器，从而生成可以继续复制的原始机器的工作复制。有些机器会向后执行此操作，复制描述，然后构建一台机器。至关重要的是，自我复制机器可以通过不断累积描述的突变而不是机器本身来进化，从而获得在复杂性中增长的能力。
1949年，冯 · 诺依曼在伊利诺伊大学厄巴纳-香槟分校的演讲中明确指出，他的目标是设计一种机器，其复杂性可以自动增长，类似于自然选择下的生物有机体。他问，机器要想进化，必须跨越多大的复杂性门槛。他的答案是指定一个抽象的机器，当运行时，它会自我复制。在他的设计中，自我复制机械包括3个部分: 一个对(‘蓝图’或程序)本身的“描述”，一个可以读取任何描述并构造机器的通用构造机制(无描述) ，以及一个可以复制任何描述的通用复印机。在使用通用构造函数构造描述中编码的新机器之后，使用复制机器创建描述的副本，并将该副本传递给新机器，从而生成可以继续复制的原始机器的工作复制。有些机器会向后执行此操作，复制描述，然后构建一台机器。至关重要的是，自我复制机器可以通过不断累积描述的突变而不是机器本身来进化，从而获得在复杂性中增长的能力。
'''''【终译版】'''''1949年，冯 · 诺依曼在伊利诺伊大学厄巴纳-香槟分校的演讲中提到，他的目标是设计一种复杂性可以自动增长，类似于自然选择下有机生命体的机器。在被问到机器要跨越''多高的复杂性阈值才''能够进化时，他给出了一个在运行中会自我复制的抽象机器模型（self-replicating machine）。自复制机由三部分组成：1、一个关于自身的“描述”（蓝图或编码）；2、可以阅读任何描述并基于描述构建机器的''通用构造''机制（universal constructor mechanism），该机制本身无具体描述；3、可以复制任何描述的复制机（copy machine）。在''通用构造''机制基于描述构建新机器后，复制机用于生成该描述的副本，并将该副本传递给新机器，从而产生原始机器的工作复制可以继续繁殖。有些机器会倒着做，复制描述，然后建造一台机器。至关重要的是，自我复制机器可以通过积累描述的突变而不是机器本身来进化，从而获得了增加复杂性的能力。
'''''【终译版】'''''1949年，冯 · 诺依曼在伊利诺伊大学厄巴纳-香槟分校的演讲中提到，<ref name="TSRA" />他的目标是设计一种复杂性可以自动增长，类似于自然选择下有机生命体的机器。在被问到机器要跨越''多高的复杂性阈值才''能够进化时，<ref name="Rocha1998" />他给出了一个在运行中会自我复制的抽象机器模型（self-replicating machine）。自复制机由三部分组成：1、一个关于自身的“描述”（蓝图或编码）；2、可以阅读任何描述并基于描述构建机器的''通用构造''机制（universal constructor mechanism），该机制本身无具体描述；3、可以复制任何描述的复制机（copy machine）。在''通用构造''机制基于描述构建新机器后，复制机用于生成该描述的副本，并将该副本传递给新机器，从而产生原始机器的工作复制可以继续繁殖。有些机器会倒着做，复制描述，然后建造一台机器。至关重要的是，自我复制机器可以通过积累描述的突变而不是机器本身来进化，从而获得了增加复杂性的能力。<ref name="Rocha1998" /><ref name="Brenner2012" />
To define his machine in more detail, von Neumann invented the concept of a [[cellular automata|cellular automaton]]. The [[Von Neumann cellular automaton|one he used]] consists of a two-dimensional grid of cells, each of which can be in one of 29 states at any point in time. At each timestep, each cell updates its state depending on the states of the surrounding cells at the prior timestep. The rules governing these updates are identical for all cells.
To define his machine in more detail, von Neumann invented the concept of a [[cellular automata|cellular automaton]]. The [[Von Neumann cellular automaton|one he used]] consists of a two-dimensional grid of cells, each of which can be in one of 29 states at any point in time. At each timestep, each cell updates its state depending on the states of the surrounding cells at the prior timestep. The rules governing these updates are identical for all cells.
为了更详细地定义他的机器，von Neumann 发明了细胞自动机的概念。他使用的那个由一个二维的细胞网格组成，每个细胞在任何时间点都可以处于29种状态之一。在每个时间步骤中，每个单元根据前一个时间步骤中周围单元的状态更新其状态。管理这些更新的规则对所有单元格都是相同的。
为了更详细地定义他的机器，von Neumann 发明了细胞自动机的概念。他使用的那个由一个二维的细胞网格组成，每个细胞在任何时间点都可以处于29种状态之一。在每个时间步骤中，每个单元根据前一个时间步骤中周围单元的状态更新其状态。管理这些更新的规则对所有单元格都是相同的。
'''''【终译版】'''''为了更详细地定义他的机器，冯诺依曼发明了元胞自动机的概念。在他所使用的一个包括细胞，其中的每一个可以在任何时间点在29个状态中的一个的二维网格。在每个时间步，每个单元格都根据前一个时间步长的周围单元格的状态更新其状态。管理这些更新的规则对于所有单元都是相同的。
'''''【终译版】'''''为了更详细地定义他的机器，冯诺依曼发明了元胞自动机（cellular automaton）的概念。在他所使用的一个包括细胞，其中的每一个可以在任何时间点在29个状态中的一个的二维网格。在每个时间步，每个单元格都根据前一个时间步长的周围单元格的状态更新其状态。管理这些更新的规则对于所有单元都是相同的。
The universal constructor is a certain pattern of cell states in this cellular automaton. It contains one line of cells that serve as the description (akin to [[Turing machine|Turing's tape]]), encoding a sequence of instructions that serve as a 'blueprint' for the machine. The machine reads these instructions one by one and performs the corresponding actions. The instructions direct the machine to use its 'construction arm' (another automaton that functions like an [[Operating System]]<ref name=Rocha1998/>) to build a copy of the machine, without the description tape, at some other location in the cell grid. The description cannot contain instructions to build an equally long description tape, just as a container cannot contain a container of the same size. Therefore, the machine includes the separate copy machine which reads the description tape and passes a copy to the newly constructed machine. The resulting new set of universal constructor and copy machines plus description tape is identical to the old one, and it proceeds to replicate again.
The universal constructor is a certain pattern of cell states in this cellular automaton. It contains one line of cells that serve as the description (akin to [[Turing machine|Turing's tape]]), encoding a sequence of instructions that serve as a 'blueprint' for the machine. The machine reads these instructions one by one and performs the corresponding actions. The instructions direct the machine to use its 'construction arm' (another automaton that functions like an [[Operating System]]<ref name=Rocha1998/>) to build a copy of the machine, without the description tape, at some other location in the cell grid. The description cannot contain instructions to build an equally long description tape, just as a container cannot contain a container of the same size. Therefore, the machine includes the separate copy machine which reads the description tape and passes a copy to the newly constructed machine. The resulting new set of universal constructor and copy machines plus description tape is identical to the old one, and it proceeds to replicate again.
= 目的 =
= 目的 =
[[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/>|链接=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/>'''''【终译版】'''''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]]
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/>
— Sydney Brenner 悉尼布伦纳
— Sydney Brenner 悉尼布伦纳
=== Evolution of Complexity ===
=== Evolution of Complexity ===
= = = 进化的复杂性 = = =
=== 复杂性的演变 ===
Von Neumann's goal, as specified in his lectures at the University of Illinois in 1949,<ref name="TSRA"/> was to design a machine whose complexity could grow automatically akin to biological organisms under [[Natural Selection|natural selection]]. He asked what is the ''threshold of complexity'' that must be crossed for machines to be able to evolve and grow in complexity.<ref name=Rocha1998/><ref name=McMullin2000/> His “proof-of-principle” designs showed how it is logically possible. By using an architecture that separates a general purpose programmable (“universal”) constructor from a general purpose copier, he showed how the descriptions (tapes) of machines could accumulate mutations in self-replication and thus evolve more complex machines (the image below illustrates this possibility.). This is a very important result, as prior to that, it might have been conjectured that there is a fundamental logical barrier to the existence of such machines; in which case, biological organisms, which do evolve and grow in complexity, could not be “machines”, as conventionally understood. Von Neumann's insight was to think of life as a Turing Machine, which, is similarly defined by a state-determined machine "head" separated from a memory tape.<ref name=Brenner2012/>
Von Neumann's goal, as specified in his lectures at the University of Illinois in 1949,<ref name="TSRA"/> was to design a machine whose complexity could grow automatically akin to biological organisms under [[Natural Selection|natural selection]]. He asked what is the ''threshold of complexity'' that must be crossed for machines to be able to evolve and grow in complexity.<ref name=Rocha1998/><ref name=McMullin2000/> His “proof-of-principle” designs showed how it is logically possible. By using an architecture that separates a general purpose programmable (“universal”) constructor from a general purpose copier, he showed how the descriptions (tapes) of machines could accumulate mutations in self-replication and thus evolve more complex machines (the image below illustrates this possibility.). This is a very important result, as prior to that, it might have been conjectured that there is a fundamental logical barrier to the existence of such machines; in which case, biological organisms, which do evolve and grow in complexity, could not be “machines”, as conventionally understood. Von Neumann's insight was to think of life as a Turing Machine, which, is similarly defined by a state-determined machine "head" separated from a memory tape.<ref name=Brenner2012/>
'''''【终译版】'''''在实践中，当我们考虑冯诺依曼所追求的特定自动机实现时，我们得出结论，它不会产生太多的进化动力学，因为机器太脆弱了——绝大多数扰动会导致它们有效地瓦解。因此，今天更令人感兴趣的是他在伊利诺伊州的讲座中概述的概念模型，因为它展示了机器在原则上是如何进化的。这种洞察力更加显着，因为该模型先于上述讨论的 DNA 分子结构的发现。还值得注意的是，冯诺依曼的设计认为，向更复杂的突变需要发生在不涉及自我复制本身的子系统（描述）中，正如他认为执行所有不直接参与复制的功能的附加自动机''D''概念化的那样（见上图与冯诺依曼的具有进化能力的自我复制自动机系统。）事实上，在生物有机体中，仅观察到遗传密码的非常微小的变化，这与冯诺依曼的基本原理相吻合，即通用构造函数（''A''）和复印机（''乙''）不会自己发展，使所有的进化（和复杂性的增长），以自动''d''。在他未完成的作品中，冯诺依曼还简要考虑了他的自我复制机器之间的冲突和相互作用，以从他的自我复制机器理论中理解生态和社会互动的演变。
'''''【终译版】'''''在实践中，当我们考虑冯诺依曼所追求的特定自动机实现时，我们得出结论，它不会产生太多的进化动力学，因为机器太脆弱了——绝大多数扰动会导致它们有效地瓦解。因此，今天更令人感兴趣的是他在伊利诺伊州的讲座中概述的概念模型，因为它展示了机器在原则上是如何进化的。这种洞察力更加显着，因为该模型先于上述讨论的 DNA 分子结构的发现。还值得注意的是，冯诺依曼的设计认为，向更复杂的突变需要发生在不涉及自我复制本身的子系统（描述）中，正如他认为执行所有不直接参与复制的功能的附加自动机''D''概念化的那样（见上图与冯诺依曼的具有进化能力的自我复制自动机系统。）事实上，在生物有机体中，仅观察到遗传密码的非常微小的变化，这与冯诺依曼的基本原理相吻合，即通用构造函数（''A''）和复印机（''乙''）不会自己发展，使所有的进化（和复杂性的增长），以自动''d''。在他未完成的作品中，冯诺依曼还简要考虑了他的自我复制机器之间的冲突和相互作用，以从他的自我复制机器理论中理解生态和社会互动的演变。
[[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.|链接=Special:FilePath/Pesavento_replicator_inherited_mutations.png]]
[[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]]
== Implementations ==
== Implementations ==
= 实现 =
In automata theory, the concept of a ''universal constructor'' is non-trivial because of the existence of [[Garden of Eden (cellular automaton)|Garden of Eden patterns]]. But a simple definition is that a universal constructor is able to construct any finite pattern of non-excited (quiescent) cells.
In automata theory, the concept of a ''universal constructor'' is non-trivial because of the existence of [[Garden of Eden (cellular automaton)|Garden of Eden patterns]]. But a simple definition is that a universal constructor is able to construct any finite pattern of non-excited (quiescent) cells.
=== Comparison of implementations ===
=== Comparison of implementations ===
= = = 实现比较 = = =
=== 各实现间的比较 ===
{| class="wikitable sortable" style="text-align:center"
{| class="wikitable sortable" style="text-align:center"
|超线性
|超线性
|}
|}
As defined by von Neumann, universal construction entails the construction of passive configurations, only. As such, the concept of universal construction constituted nothing more than a literary (or, in this case, mathematical) device. It facilitated other proof, such as that a machine well constructed may engage in self-replication, while universal construction itself was simply assumed over a most minimal case. Universal construction under this standard is trivial. Hence, while all the configurations given here can construct any passive configuration, none can construct the real-time crossing organ devised by Gorman.<ref name="Automata2008" />
As defined by von Neumann, universal construction entails the construction of passive configurations, only. As such, the concept of universal construction constituted nothing more than a literary (or, in this case, mathematical) device. It facilitated other proof, such as that a machine well constructed may engage in self-replication, while universal construction itself was simply assumed over a most minimal case. Universal construction under this standard is trivial. Hence, while all the configurations given here can construct any passive configuration, none can construct the real-time crossing organ devised by Gorman.<ref name="Automata2008" />
= 动画画廊 =
= 动画画廊 =
[[文件:320 jump read arm.gif|左|缩略图|Example of a 29-state read arm. 来自维基百科]]
[[文件:320 jump read arm.gif|缩略图|Example of a 29-state read arm. 来自维基百科|替代=|无]]
Example of a 29-state read arm.
Example of a 29-state read arm.
'''''【终译版】'''''29 状态读取臂的示例。
'''''【终译版】'''''29 状态读取臂的示例。
= 另见 =
= 关联条目 =
*[[Codd's cellular automaton]]
*[[Codd's cellular automaton]]
*[[Langton's loops]]
*[[Langton's loops]]
*[[Constructor theory]]
*[[Constructor theory]]
= 参考文献 =
= 参考文献[编辑] =
{{Reflist}}
{{Reflist}}
*John von Neumann's 29 state Cellular Automata Implemented in OpenLaszlo by Don Hopkins
*John von Neumann's 29 state Cellular Automata Implemented in OpenLaszlo by Don Hopkins
*A Catalogue of Self-Replicating Cellular Automata. This catalogue complements the Proc. Automata 2008 volume.
*A Catalogue of Self-Replicating Cellular Automata. This catalogue complements the Proc. Automata 2008 volume.
*
*'''''【终译版】'''''
*
*