7,129
个编辑
更改
跳到导航
跳到搜索
第71行：
第71行： − {| class="wikitable sortable" style="text-align:center" − |- − ! Implementation !! Source !! Ruleset !! Rectangular area !! Number of cells !! Length of tape !! Ratio !! Period !! Tape code compression !! Tape code length !! Tape code type !! Replication mechanism !! Replication type !! Growth rate − |- − ! Nobili-Pesavento, 1995<ref name=Pesavento1995/> − | {{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 × 170 || 6,329 || 145,315 || 22.96 || 6.34{{times}}10<sup>10</sup> || {{CNone|none}} || 5 bits || binary || holistic constructor || {{no2|non-repeatable}} || linear − |- − ! Nobili, 2007 − | SR_CCN_AP.EVN<ref name=nobili2007 /> || Nobili 32-state || 97 × 100 || 5,313 || 56,325 || 10.60 || 9.59{{times}}10<sup>9</sup> || run-length limited encoding || 5 bits || binary || holistic constructor || {{yes2|repeatable}} || super-linear − |- − ! Buckley, 2008 − | codon5.rle<ref name="sourceforge.net">{{cite web|url=http://www.sourceforge.net/projects/golly|title=Golly, a Game of Life simulator|author=andykt|work=SourceForge}}</ref> || Nobili 32-state || 112 × 50 || 3,343 || 44,155 || 13.21 || 5.87{{times}}10<sup>9</sup> || auto-retraction || 5 bits || binary || holistic constructor || {{yes2|repeatable}} || linear − |- − ! Buckley, 2008<ref name=Automata2008/> − | replicator.mc || von Neumann 29-state || 312 × 132 || 18,589 || 294,844 || 15.86 || 2.61{{times}}10<sup>11</sup> || auto-retraction || 5 bits || binary || holistic constructor || {{yes2|repeatable}} || linear − |- − ! Buckley, 2008 − | codon4.rle<ref name="sourceforge.net"/> || Nobili 32-state || 109 × 59 || 3,574 || 37,780 || 10.57 || 4.31{{times}}10<sup>9</sup> || auto-retraction/bit generation || 4 bits || binary || holistic constructor || {{yes2|repeatable}} || linear − |- − ! Buckley, 2009 − | codon3.rle || Nobili 32-state || 116 × 95 || 4,855 || 23,577 || 4.86 || 1.63{{times}}10<sup>9</sup> || auto-retraction/bit generation/code overlay || 3 bits || binary || holistic constructor || {{yes2|repeatable}} || super-linear − |- − ! Buckley, 2009 − | PartialReplicator.mc<ref name="sourceforge.net"/> || von Neumann 29-state || 2063 × 377 || 264,321 || {{NA}} || {{sdash}} || ≈1.12{{times}}10<sup>14</sup> || {{CNone|none}} || 4 bits || binary || partial constructor || {{yes2|repeatable}} || linear − |- − ! Goucher & Buckley, 2012 − | phi9.rle<ref name=":0">{{cite web|url=http://cp4space.wordpress.com/2012/11/12/self-replication/|title=Self-replication|work=Complex Projective 4-Space}}</ref>|| Nobili 32-state || 122 × 60 || 3957 || 8920 || 2.25 || {{sdash}} || auto-retraction/bit generation/code overlay/run length limited || 3+ bits || ternary || holistic constructor || {{yes2|repeatable}} || super-linear − |} − − {| class="wikitable sortable" style="text-align:center" − |- − ! Implementation !! Source !! Ruleset !! Rectangular area !! Number of cells !! Length of tape !! Ratio !! Period !! Tape code compression !! Tape code length !! Tape code type !! Replication mechanism !! Replication type !! Growth rate − |- − ! Nobili-Pesavento, 1995 − | || Nobili 32-state || 97 × 170 || 6,329 || 145,315 || 22.96 || 6.341010 || || 5 bits || binary || holistic constructor || || linear − |- − ! Nobili, 2007 − | SR_CCN_AP.EVN || Nobili 32-state || 97 × 100 || 5,313 || 56,325 || 10.60 || 9.59109 || run-length limited encoding || 5 bits || binary || holistic constructor || || super-linear − |- − ! Buckley, 2008 − | codon5.rle || Nobili 32-state || 112 × 50 || 3,343 || 44,155 || 13.21 || 5.87109 || auto-retraction || 5 bits || binary || holistic constructor || || linear − |- − ! Buckley, 2008 − | replicator.mc || von Neumann 29-state || 312 × 132 || 18,589 || 294,844 || 15.86 || 2.611011 || auto-retraction || 5 bits || binary || holistic constructor || || linear − |- − ! Buckley, 2008 − | codon4.rle || Nobili 32-state || 109 × 59 || 3,574 || 37,780 || 10.57 || 4.31109 || auto-retraction/bit generation || 4 bits || binary || holistic constructor || || linear − |- − ! Buckley, 2009 − | codon3.rle || Nobili 32-state || 116 × 95 || 4,855 || 23,577 || 4.86 || 1.63109 || auto-retraction/bit generation/code overlay || 3 bits || binary || holistic constructor || || super-linear − |- − ! Buckley, 2009 − | PartialReplicator.mc || von Neumann 29-state || 2063 × 377 || 264,321 || || || ≈1.121014 || || 4 bits || binary || partial constructor || || linear − |- − ! Goucher & Buckley, 2012 − | phi9.rle || Nobili 32-state || 122 × 60 || 3957 || 8920 || 2.25 || || auto-retraction/bit generation/code overlay/run length limited || 3+ bits || ternary || holistic constructor || || super-linear − |} − − − '''''【终译版】''''' 第269行：
第209行： −
→各实例间的比较 =
== 各实例间的比较 ===
== 各实例间的比较 ===
{| class="wikitable sortable"
{| class="wikitable sortable"
!实例
!实例
正如冯诺依曼所定义的，通用构造过程的产物只包含被动“被”构建的结构。因此，通用构造器的概念只不过是一种设想（或是数学）结构。尽管它有助于其他的证明，比如构造良好的机器有可能会自我复制，但通用构造过程本身只是在最简单情况下的设想。此标准下的通用构造概念是不值一提的。因此，尽管这里给出的所有结构都可以构建出新的相似结构（新结构仅能被动的“被”构建），但没有一个可以实现Gorman 设计的实时交互机制 Real-Time Crossing Organ。<ref name="Automata2008" />
正如冯诺依曼所定义的，通用构造过程的产物只包含被动“被”构建的结构。因此，通用构造器的概念只不过是一种设想（或是数学）结构。尽管它有助于其他的证明，比如构造良好的机器有可能会自我复制，但通用构造过程本身只是在最简单情况下的设想。此标准下的通用构造概念是不值一提的。因此，尽管这里给出的所有结构都可以构建出新的相似结构（新结构仅能被动的“被”构建），但没有一个可以实现Gorman 设计的实时交互机制 Real-Time Crossing Organ。<ref name="Automata2008" />
== 实用性和计算成本 ==
== 实用性和计算成本 ==