Physics-like models of computation. (English) Zbl 0563.68051

Margolus, Norman

Cellular automata, Proc. Interdisc. Workshop, Los Alamos/N.M. 1983, Physica D 10, No. 1-2, 81-95 (1984).

Summary: Reversible Cellular Automata are computer-models that embody discrete analogues of the classical-physics notions of space, time, locality, and microscopic reversibility. They are offered as a step towards models of computation that are closer to fundamental physics.
[For the entire collection see Zbl 0556.00013.]

MSC:

68Q80

Cellular automata (computational aspects)

Keywords:

reversible cellular automata

Citations:

Zbl 0556.00013

References:

[1]	. Int. J. Of theo. Phys. 21, 905-940 (1982)
[2]	E. Fredkin, private communication.
[3]	Fredkin, E.; Toffoli, T.: Conservative logic. Int. J. Of theo. Phys. 21, 219-253 (1982) · Zbl 0496.94015
[4]	Berlekamp, E.; Conway, J.; Guy, R.: Winning ways for your mathematical plays. 2 (1982) · Zbl 0485.00025
[5]	Gardner, M.: The fantastic combinations of John Conway’s new solitaire game ’life’. Scientific American 223, No. 4, 120-123 (1970)
[6]	Landauer, R.: Irreversibility and heat generation in the computing process. IBM journal of research and development 5, 183-191 (1961) · Zbl 1160.68305
[7]	Shannon, C.; Weaver, W.: The mathematical theory of communication. (1949) · Zbl 0041.25804
[8]	Toffoli, T.: Computation and construction universality of reversible cellular automata. Journal of computer systems science 15, 213-231 (1977) · Zbl 0364.94085
[9]	Toffoli, T.: Cam: A high-performance cellular-automaton machine. Physica 10D, 195-204 (1984)
[10]	Von Neumann, J.: Theory of self-reproducing automata. (1966)