Byl's loop: Difference between revisions
merged into Langton's loops |
|||
| Line 1: | Line 1: | ||
The '''Byl's loop''' is an [[artificial life|artificial lifeform]] similar in concept to [[Langton's loops|Langton's loop]]. It is a two-dimensional, 5-neighbor [[cellular automaton]] with 6 states per cell, and was developed in 1989 by John Byl, from the Department of Mathematical Sciences of [[Trinity Western University]]. |
|||
#REDIRECT [[Langton's_loops]] {{R from merge}} |
|||
== Details == |
|||
The Byl's loop was developed just a few years after Langton's simplification of [[Codd's automaton]], which produced a simpler automaton (shown below) that would reproduce itself in 151 time-steps. John Byl simplified Langton's automaton further, with an even smaller automaton that reproduced in just 25 time-steps. Byl's automaton consisted of an array of 12 chips — of which 4 or 5 could be counted as the instruction tape — and 43 transition rules, while Langton's device consisted of some 10x15 chips, including an instruction tape of 33 chips, plus some 190 transition rules. |
|||
Essentially, the simplification consisted in using less cellular states (6 as compared with Langton's 8) and a smaller replicating loop (12 cells as compared with Langton's 86). |
|||
{{quotation|In 1989, John Byl devised a self-reproducing automata so small, twelve cells in six states with fifty-seven transition rules, that it undermines "von Neumann's 'complexity threshold' separating trivial from non-trivial self-replication" (Sigmund 1993:24<ref>{{cite book |
|||
|title = Games of Life: Explorations in Ecology, Evolution and Behaviour |
|||
|subtitle = adsf |
|||
|author = [[Karl Sigmund]] |
|||
|url = http://books.google.pt/books?id=qVwIAAAACAAJ |
|||
|year = 1995 |
|||
|page = 24 |
|||
|publisher = [[Penguin]] |
|||
|ISBN = 0140242090 |
|||
}}</ref>). |
|||
- [http://www.sciencetimeline.net/1961.htm ScienceTimeLine.net (1961-2003)]}} |
|||
== See also == |
|||
* [[Langton's loops]] |
|||
* [[Chou-Reggia loop]] |
|||
== References == |
|||
{{reflist}} |
|||
== Further reading == |
|||
* {{citation |
|||
|author = John Byl |
|||
|title = Self-Reproduction in Small Cellular Automata |
|||
|url = http://books.google.com/books?id=UIsrNAAACAAJ |
|||
|journal = [[Physica D]] |
|||
|volume = 34 |
|||
|pages = 295-299 |
|||
|year = 1989 |
|||
}} |
|||
* {{citation |
|||
|author = John Byl |
|||
|title = On Cellular Automata and the Origin of Life |
|||
|url = http://www.asa3.org/ASA/PSCF/1989/PSCF3-89Byl.html |
|||
|journal = Perspectives on Science and Christian Faith |
|||
|publisher = [[American Scientific Affiliation]] |
|||
|volume = 41 |
|||
|issue = 1 |
|||
|pages = 26-29 |
|||
|year = 1989 |
|||
|month = March |
|||
}} |
|||
== External links == |
|||
* [http://necsi.org/postdocs/sayama/sdsr/java/ visual representation] of the Byl's loop in [[Java]] |
|||
* {{cite web |
|||
|url = http://www.arn.org/docs/newman/rn_artificiallife.htm |
|||
|title = Artificial Life and Cellular Automata |
|||
|author = Robert C. Newman |
|||
}} |
|||
* See [http://cafaq.com/apps/index.php Cellular Automata FAQ - Applications] (section "What are Byl's rules for a self reproducing CA?") for the full rule set of Byl's loop |
|||
* {{citation |
|||
|url = http://lslwww.epfl.ch/pages/embryonics/thesis/Chapter3.html |
|||
|chapter = Chapter 3: Self-Replication |
|||
|author = Gianluca Tempesti |
|||
|title = A Self-Repairing Multiplexer-Based FPGA Inspired by Biological Processes |
|||
|year=1998 |
|||
}} |
|||
[[Category:Artificial life]] |
|||
[[Category:Cellular automata]] |
|||
Revision as of 22:09, 4 February 2009
The Byl's loop is an artificial lifeform similar in concept to Langton's loop. It is a two-dimensional, 5-neighbor cellular automaton with 6 states per cell, and was developed in 1989 by John Byl, from the Department of Mathematical Sciences of Trinity Western University.
Details
The Byl's loop was developed just a few years after Langton's simplification of Codd's automaton, which produced a simpler automaton (shown below) that would reproduce itself in 151 time-steps. John Byl simplified Langton's automaton further, with an even smaller automaton that reproduced in just 25 time-steps. Byl's automaton consisted of an array of 12 chips — of which 4 or 5 could be counted as the instruction tape — and 43 transition rules, while Langton's device consisted of some 10x15 chips, including an instruction tape of 33 chips, plus some 190 transition rules.
Essentially, the simplification consisted in using less cellular states (6 as compared with Langton's 8) and a smaller replicating loop (12 cells as compared with Langton's 86).
In 1989, John Byl devised a self-reproducing automata so small, twelve cells in six states with fifty-seven transition rules, that it undermines "von Neumann's 'complexity threshold' separating trivial from non-trivial self-replication" (Sigmund 1993:24[1]). - ScienceTimeLine.net (1961-2003)
See also
References
- ^ Karl Sigmund (1995). Games of Life: Explorations in Ecology, Evolution and Behaviour. Penguin. p. 24. ISBN 0140242090.
{{cite book}}: Unknown parameter|subtitle=ignored (help)
Further reading
- John Byl (1989), "Self-Reproduction in Small Cellular Automata", Physica D, 34: 295–299
- John Byl (1989), "On Cellular Automata and the Origin of Life", Perspectives on Science and Christian Faith, 41 (1), American Scientific Affiliation: 26–29
{{citation}}: Unknown parameter|month=ignored (help); soft hyphen character in|journal=at position 8 (help)
External links
- visual representation of the Byl's loop in Java
- Robert C. Newman. "Artificial Life and Cellular Automata".
- See Cellular Automata FAQ - Applications (section "What are Byl's rules for a self reproducing CA?") for the full rule set of Byl's loop
- Gianluca Tempesti (1998), "Chapter 3: Self-Replication", A Self-Repairing Multiplexer-Based FPGA Inspired by Biological Processes