Name
Abstract | ||
|---|---|---|
It is shown that some kind of meaningful computation can be embedded in very simple, microscopically homogeneous, one-dimensional automata, and in particular filter automata with a parity next-state rule. A systematic procedure is given for generating moving, periodic structures (particles). These particles exhibit soliton-like properties; that is, they often pass through one another with phase shifts. Ways to encode information in the phase of these particles are discussed. The search for useful logical operations is reduced to a search for paths in certain graphs. As a demonstration of principle, the details of implementing a carry-ripple adder are given |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1109/12.2143 | IEEE Trans. Computers |
Keywords | Field | DocType |
adders,carry logic,filters,finite automata,graph theory,parity,phase modulation,solitons,carry-ripple adder,cellular automata,computation embedding,filter automata with a parity next-state rule,one-dimensional automata,parallel computation,particle generation,path searching in graphs,phase coding,solitons | Graph theory,Quantum finite automata,Embedding,Adder,Computer science,Automaton,Algorithm,Finite-state machine,ω-automaton,Computation | Journal |
Volume | Issue | ISSN |
37 | 2 | 0018-9340 |
Citations | PageRank | References |
14 | 8.29 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kenneth Steiglitz | 1 | 1128 | 660.13 |
| I. Kamal | 2 | 14 | 8.29 |
| A. Watson | 3 | 14 | 8.29 |