Jacopini, Giuseppe, and Giovanna Sontacchi, \Reversible parallel computation: an evolving space model," to appear in Theor. Comp. Sci. 75 (1990).  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... physics (that had already been probed by Zuse[49] and To oli[30] ared up in the 80s with another impersonation of cellular automata, namely lattice gases[9] Actually the lattice gas scheme was arrived at independently, but in response to similar physical motivations, by many investigators (cf. [12, 29, 31, 7, 8, 18, 4, 34, 14, 15, 16]) its usefulness was underlined by Fredkin s insights into reversible computation[8, 7] and a number of original applications by Margolus[18, 34] who introduced the Margolus neighborhood [33] and coined the term partitioning cellular automata . Meanwhile, Wolfram had been investigating mainly ....

Jacopini, Giuseppe, and Giovanna Sontacchi, \Reversible parallel computation: an evolving space model," to appear in Theor. Comp. Sci. 75 (1990).

....in [61] which brought to light a number of subtle issues somehow related to invertibility. But invertibility was explicitly addressed only in 1972, in seminal papers by Richardson[60] and Amoroso and Patt[2] #4 After that, theoretical work on invertibility in cellular automata proliferated[3,61,54,46 48,90,35]. In spite of that work, however, for many #4 Unbeknownst to those authors, systems that are in essence one dimensional cellular automata had already been studied in an abstract mathematical context by Hedlund and associates as early as 1963[30,31] both Richardson s results on invertibility ....

....approach. Since then, for almost twenty years a quest for these generalizations to more than one dimension went on with little success. Invertibility and related properties for the one dimensional case were revisited in [54,87,14,29] Many equivalent characterizations of ica were given[90,47,48,35], but none that offered a finitary handle on invertibility. Finally, quite recently, Kari proved that Theorem 4.5 (Kari[38,39] There is no effective procedure for deciding whether or not an arbitrary two dimensional cellular automaton, given in terms of a local map, is invertible. His proof is ....

[Article contains additional citation context not shown here]

Jacopini, Giuseppe, and Giovanna Sontacchi, "Reversible parallel computation: an evolving space model," to appear in Theor. Comp. Sci. 75 (1990).

....instance, 55, 7, 8, 10] to light a number of subtle issues somehow related to invertibility. But invertibility was explicitly addressed only in 1972, in seminal papers by Richardson[60] and Amoroso and Patt[2] 4 After that, theoretical work on invertibility in cellular automata proliferated[3, 61, 54, 46, 47, 48, 90, 35]. In spite of that work, however, for many years the most interesting ica actually exhibited remained an extremely simpleminded one (the longest orbit is of period two ) discovered by Patt through brute force enumeration[56] Ica continued to appear to be quite rare [2] Not only rare, but also ....

....approach. Since then, for almost twenty years a quest for these generalizations to more than one dimension went on with little success. Invertibility and related properties for the onedimensional case were revisited in [54, 87, 14, 29] Many equivalent characterizations of ica were given[90, 47, 48, 35], but none that offered a finitary handle on invertibility. Finally, quite recently, Kari proved that Theorem 4.5 (Kari[38, 39] There is no effective procedure for deciding whether or not an arbitrary twodimensional cellular automaton, given in terms of a local map, is invertible. His proof is ....

[Article contains additional citation context not shown here]

Jacopini, Giuseppe, and Giovanna Sontacchi, "Reversible parallel computation: an evolving space model," to appear in Theor. Comp. Sci. 75 (1990).

....invertible cellular automata having bounded neighborhood, but whose inverses constitute a class of cellular automata for which there isn t any recursive function bounding all the neighborhood. 1 Introduction Computational models satisfying physical laws are the subject of several recent studies [8, 3]; of particular interest are invertible models [5, 8] Cellular automata represent one of the best models of parallel computation; the study of invertibility in cellular automata is of great interest in modelling physics. Several theoretical results concerning invertibility in cellular automata ....

....but whose inverses constitute a class of cellular automata for which there isn t any recursive function bounding all the neighborhood. 1 Introduction Computational models satisfying physical laws are the subject of several recent studies [8, 3] of particular interest are invertible models [5, 8]. Cellular automata represent one of the best models of parallel computation; the study of invertibility in cellular automata is of great interest in modelling physics. Several theoretical results concerning invertibility in cellular automata have been presented ( 2, 9, 10, 12, 13, 15, 18] some ....

Jacopini, G, Sontacchi, G., (1990) "Reversible Parallel Computation: an evolving space model", Theoret. Comput. Sci. 73.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC