The DOI matches its Crossref record.
Self-Organisation in a System of Binary Strings
Abstract
We discuss a system of autocatalytic sequences of binary numbers. Sequences come in two forms, a 1dimensional form (operands) and a 2-dimensional form (operators) that are able to react with each other. The resulting reaction network shows signs of emerging metabolisms. We discuss the general framework and examine specific interactions for a system with strings of length 4 bits. A selfmaintaining network of string types and parasitic interactions are shown to exist. Introduction Published in: Proceedings ARTIFICIAL LIFE IV R. Brooks and P. Maes (Eds.) MIT Press, Cambridge, MA, 1994 pp. 109 --- 118 Sequences of binary numbers are the most primitive form of information storage we know today. They are able to code any kind of man-made information, be it still or moving images, sound waves and other sensory stimulations, be it written language or the rules of mathematics, just to name a few. As the success of vonNeumann computers has shown over the last 50 years, binary sequences are also...
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“An algorithmic reaction system can be built using abstract symbols, binary strings, numbers or even proofs [302,321].”
From Fundamental constraints to the logic of living systems (2024) · cites this paper as [302]
Citations
Cites
Still being checked.
Cited by
Sorted by citations
Fundamental constraints to the logic of living systems
Solé, R., Kempes, C. P., Corominas-Murtra, B., De Domenico, M., Kolchinsky, A., Lachmann, M., Libby, E., Saavedra, S., Smith, E., & Wolpert, D. (2024) · Interface Focus · doi:10.1098/rsfs.2024.0010 · Cited by 34
“An algorithmic reaction system can be built using abstract symbols, binary strings, numbers or even proofs [302,321].”
BackgroundSub-Symbolic Artificial Chemistries
Rainford, P. F., Krastev, M., Sebald, A., & Stepney, S. (2017) · Emergence, complexity and computation · doi:10.1007/978-3-319-67997-6_14 · Cited by 7
A graph-based reflexive artificial chemistry
Salzberg, C. (2006) · Biosystems · doi:10.1016/j.biosystems.2005.12.008 · Cited by 5
Controlling Self-organization in Generative Creative Systems
Young, J., & Colton, S. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-43859-3_14 · Cited by 2
Minimizing Volatility by Biological ComplexityPreprint
Agarwal, N. (2003) · SSRN Electronic Journal · doi:10.2139/ssrn.383343
Metadata
- Authors
- Banzhaf, W.
- Corresponding author
- Banzhaf, Wolfgang
- ORCID
- Banzhaf, Wolfgang
- Venue
- Artificial Life IV
- Publisher
- The MIT Press
- Published
- 1994-09-13
- Pages
- 102-111
- OpenAlex
- W4238749244
- Cited by
- 5
- References
- 0
- Citations by year
- 2024: 1 · 2020: 1 · 2017: 1
- FWCI
- 0.00
- Type
- book chapter
- Language
- en
- Open access
- closed
- Locations
- The MIT Press eBooks (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
- Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
- Physical Sciences › Physics and Astronomy › Astronomy and Astrophysics › Origins and Evolution of Life
- Keywords
- self-organization, binary strings, reaction networks, parasitic interactions, artificial life, information storage
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
