### Abstract

We show how to regard covered logic programs as cellular automata. Covered logic programs are ones for which every variable occurring in the body of a given clause also occurs in the head of the same clause. We generalize the class of register machine programs to permit negative literals and characterize the members of this class of programs as n-state 2-dimensional cellular automata. We show how monadic covered programs, the class of which is computationally universal, can be regarded as 1-dimensional cellular automata. We show how to continuously (and differentiably) deform 1-dimensional cellular automata from one to another and understand the arrangement of these cellular automata in a separable Hilbert space over the real numbers. The embedding of the cellular automata of fixed radius r is a linear mapping into R^{22r+1} in which a cellular automaton's transition function is the attractor of a state-governed iterated function system of affine contraction mappings. The class of covered monadic programs having a particular fixed point has a uniform arrangement in an affine subspace of the Hilbert space ℓ^{2}. Furthermore, these programs are construable as almost everywhere continuous functions from the unit interval {x

Original language | English (US) |
---|---|

Pages (from-to) | 153-186 |

Number of pages | 34 |

Journal | Annals of Mathematics and Artificial Intelligence |

Volume | 21 |

Issue number | 2-4 |

State | Published - 1997 |

### Fingerprint

### ASJC Scopus subject areas

- Artificial Intelligence
- Applied Mathematics

### Cite this

*Annals of Mathematics and Artificial Intelligence*,

*21*(2-4), 153-186.