The complexity of reversible cellular automata

Authors:
K. Sutner
Affiliations:
Computer Science Department, School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA
Venue:
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Year:
2004

Citing 8
Cited 3

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
Time/space trade-offs for reversible computation

SIAM Journal on Computing
Ininvertible cellular automata: a review

Physica D
Classifying circular cellular automata

Physica D
Computation-universality of one-dimensional one-way reversible cellular automata

Information Processing Letters
A new kind of science

A new kind of science
Cellular automata and intermediate degrees

Theoretical Computer Science
Almost periodic configurations on linear cellular automata

Fundamenta Informaticae - Special issue on cellular automata

Hybrid one-dimensional reversible cellular automata are regular

Discrete Applied Mathematics
Universality and cellular automata

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
A Revised Attack on Computational Ontology

Minds and Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the orbits of reversible one-dimensional cellular automata. It is shown that the Turing degree structure of the orbits of these automata is the same as for general cellular automata. In particular there are reversible cellular automata whose orbits have arbitrary recursively enumerable degree.