Rennard, Jean-Philippe (2002) Implementation of Logical Functions in the Game of Life. [Book Chapter]
Full text available as:
|
PDF
574Kb |
Abstract
The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generators of the mobile patterns, glider guns, in its evolution. We show how to construct basic logical perations, AND, OR, NOT in space-time configurations of the cellular automaton. Also decomposition of complicated Boolean functions is discussed. Advantages of our technique are demonstrated on an example of binary adder, realized via collision of glider streams.
Item Type: | Book Chapter |
---|---|
Keywords: | cellular automata, universal Turing machine, Game of Life, collision-based computing, Boolean algebra |
Subjects: | Computer Science > Complexity Theory |
ID Code: | 4115 |
Deposited By: | Rennard, Dr. Jean-Philippe |
Deposited On: | 08 Mar 2005 |
Last Modified: | 11 Mar 2011 08:55 |
References in Article
Select the SEEK icon to attempt to find the referenced article. If it does not appear to be in cogprints you will be forwarded to the paracite service. Poorly formated references will probably not work.
Metadata
- ASCII Citation
- Atom
- BibTeX
- Dublin Core
- EP3 XML
- EPrints Application Profile (experimental)
- EndNote
- HTML Citation
- ID Plus Text Citation
- JSON
- METS
- MODS
- MPEG-21 DIDL
- OpenURL ContextObject
- OpenURL ContextObject in Span
- RDF+N-Triples
- RDF+N3
- RDF+XML
- Refer
- Reference Manager
- Search Data Dump
- Simple Metadata
- YAML
Repository Staff Only: item control page