Papers by William R. Buckley
This is C language source code of my shustringer software. It is a radix sort on bytes (binary o... more This is C language source code of my shustringer software. It is a radix sort on bytes (binary octets), and finds the shustrings of any sequence of bytes that it is given. Hence, this routine can be applied to genomics data, textual data, any kind of data that can be represented as a sequence of bytes. This is a much, much easier to understand algorithm than is the shustring software constructed by Haubold, et al.
A short discussion of shustrings and their utility as a measure of disorder over a sequence of sy... more A short discussion of shustrings and their utility as a measure of disorder over a sequence of symbols drawn on a finite symbol set.
This is an ASCII text file of the one million purely random digits that is described in the simil... more This is an ASCII text file of the one million purely random digits that is described in the similarly named .pdf file. With this file, one may easily verify the claim that all shustrings are of length six.
This paper presents a list of one million digits having the property that all shustrings over thi... more This paper presents a list of one million digits having the property that all shustrings over this list are of uniform length, at the minimum value of six. The similar sequence from RAND Corporation is not nearly so well disordered as is this digit sequence given in this paper. Indeed, we claim that no sequence of one million digits represents greater disorder than is represented by the sequence of one million purely random digits that is given in this paper.
DOI: 10.13140/2.1.3232.5444
Of interest to the theory of machines that construct is ontogeny, by which process of development... more Of interest to the theory of machines that construct is ontogeny, by which process of development the constructor is transformed from immature to mature form. Whereas we have already shown that self-replicating machines generally are able to bootstrap themselves through the construction of sub-machines (such as organs that rewind a tape, or replicate a tape, or initiate the behavior of a construct), in this paper we present in abstract a constructor that bootstraps its ability to construct, through the construction of sub-constructors. This is to say, we present a constructor that learns how to construct, and does so by constructing; our constructor is in truth a proto-constructor. Here, learning occurs by the addition of new machine configuration; each learned lesson is correlated with specific additions to machine configuration.
Biological Theory, 2008
Post publication author comment:
The key question addressed by this paper is the partition-abi... more Post publication author comment:
The key question addressed by this paper is the partition-ability of machines, with particular regard to constructing machines. We show that machines may start their behavior in an immature form and that they must develop by construction into a mature form. Further, we show that self-replication of these machines is dependent upon the mature form; immature machines cannot self-replicate. In short, machines have zygotes, too.
Computational Science–ICCS 2005, Jan 1, 2005
In von Neumann 29-state cellular automata, the crossing of signals is an important problem, with ... more In von Neumann 29-state cellular automata, the crossing of signals is an important problem, with three solutions reported in the literature. These solutions greatly impact automaton design, especially self-replicators. This paper examines these solutions, with emphasis upon their constructibility. We show that two of these solutions are difficult to construct, and offer an improved design technique. We also argue that solutions to the signal-crossing problem have implications for machine models of biological development, especially with regard to the cell cycle.
ABSTRACT Computer evolution brings ever greater benefits, and ever greater danger as well. Emergi... more ABSTRACT Computer evolution brings ever greater benefits, and ever greater danger as well. Emerging are the worm, virus, and otherwise surreptitious softwares. They brilliantly expose the current ethics of computer use to intense public scrutiny. They are (obliquely) the object of research in Artificial Life studies, for they possess some of the attributes of living beings. The US Congress is now exploring the issues, and looking to a legislative solution to viral outbreaks. Can worms and viruses be used beneficially? What does the advent o f computer viruses portend? An end to open, interconnected computer systems? What about anti viral defenses; do they work? What can we expect from future attacks by virus program? What are the limits to surreptitious software? Should surreptitious software be designed and built? What are the responsibilities of computer users to system security? A well familiar topic of the discipline , and also barely developed in specificity or application. For instance, it is well accepted that no user should violate the store occupied by another user. It is not so well accepted that the user of a network should not write a program which optimally utilizes all the unused time on each computer in that network. This paper explores a few o f these issues, presents some historical background, and points to one alternative .
Uploads
Papers by William R. Buckley
DOI: 10.13140/2.1.3232.5444
The key question addressed by this paper is the partition-ability of machines, with particular regard to constructing machines. We show that machines may start their behavior in an immature form and that they must develop by construction into a mature form. Further, we show that self-replication of these machines is dependent upon the mature form; immature machines cannot self-replicate. In short, machines have zygotes, too.
DOI: 10.13140/2.1.3232.5444
The key question addressed by this paper is the partition-ability of machines, with particular regard to constructing machines. We show that machines may start their behavior in an immature form and that they must develop by construction into a mature form. Further, we show that self-replication of these machines is dependent upon the mature form; immature machines cannot self-replicate. In short, machines have zygotes, too.