Archive

Posts Tagged ‘Reversible’

The Set of Reversible 90/150 Cellular Automata is Regular

October 25th, 2009 Ayu Siska No comments

Author

  1. Palash Sarkar
  2. Rana Barua

Content

In this article we pose and solve two problems regarding a special class of matrices over F2, the field of two element. Let, Mb, b ε {0,1}, be a square matrix over F2, having the following structure.

Download

Categories: Referensi Tags: ,

Reverssible Celullar Automata without Memory

October 22nd, 2009 Febriana Yusiyanti No comments

Author:

  1. Theofanis Raptis

Content:

First classical reversible gates introduced by Fredkin and Toffoli. Billiard Ball Model of computation (BBM) as a special type of classical CA. Possibility of “Cold Computing”.

Download

Categories: Referensi Tags: ,

Representing Reversible Cellular Automata with Reversible Block Cellular Automata

October 15th, 2009 Ayu Siska No comments

Author

  • Jerome Durand-Lose, 2001, France

Content

Cellular automata are mappings over infinite lattices such that each cell is update according to the state around it and a unique local function. Block permutations are mapping that generalize a given permutation of blocks to a given partition of the lattice in blocks.

Download

Categories: Referensi Tags: ,