๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Self-replicating sequences of binary numbers. Foundations II: Strings of length N=4

โœ Scribed by Wolfgang Banzhaf

Publisher
Springer-Verlag
Year
1993
Tongue
English
Weight
493 KB
Volume
69
Category
Article
ISSN
0340-1200

No coin nor oath required. For personal study only.

โœฆ Synopsis

We study an algorithm which allows sequences of binary numbers (strings) to interact with each other. The simplest system of this kind with a population of 4-bit sequences is considered here. Previously proposed folding methods are used to generate alternative twodimensional forms of the binary sequences. The interaction of two-dimensional and one-dimensional forms of strings is simulated in a serial computer. The reaction network for the N = 4 system is established. Development of string populations initially generated randomly is observed. Nonlinear rate equations are proposed which provide a model for this simplest system.

๐Ÿ“œ SIMILAR VOLUMES

Self-replicating sequences of binary num
Self-replicating sequences of binary numbers. Foundations I: General
โœ Wolfgang Banzhaf ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 534 KB

We propose the general framework of a new algorithm, derived from the interactions of chains of RNA, which is capable of self-organization. It considers sequences of binary numbers (strings) and their interaction with each other. Analogous to RNA systems, a folding of sequences is introduced to gene