Computing Inside the Billiard Ball Model-Reference-Cited by-同舟云学术

Computing Inside the Billiard Ball Model

Published:2002 Issue: Volume: Page:135-160
ISSN:
Container-title:Collision-Based Computing
language:
Short-container-title:

Author:

Durand-Lose Jérôme

Publisher

Springer London

Link

http://link.springer.com/content/pdf/10.1007/978-1-4471-0129-1_6.pdf

Reference31 articles.

1. Albert J. and Culik II K. A simple universal cellular automaton and its one-way and totalistic versionComplex Systems 1 (1987) 1–16

2. Bennett C.H. Logical reversibility of computation IBM Journal of Research and Development 6 (1973) 525–532

3. Burks AEssays on Cellular Automata(Univ. of Illinois Press, 1970).

4. Durand-Lose J. Reversible cellular automaton able to simulate any other reversible one using partitioning automata, In: R. Baeza-Yates and E. Goles and P. Poblete (Eds.), LATIN ’95, Lecture Notes in Computer Sciences 911 (1995) 230–244

5. Durand-Lose J. Intrinsic universality of a 1-dimensional reversible cellular automaton, In: R. Reischuk and M. Morvan (Eds.), STAGS ’97, Lecture Notes in Computer Sciences 1200 (1997) 439–450.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tailoring elastic and inelastic collisions of relativistic antiferromagnetic domain walls;Scientific Reports;2023-11-30

2. Reversible Cellular Automata: From Fundamental Classical Results to Recent Developments;New Generation Computing;2018-06-23

3. Universality of Asynchronous Circuits Composed of Locally Reversible Elements;Emergence, Complexity and Computation;2016-07-19

4. Reversible Computing;Encyclopedia of Complexity and Systems Science;2015

5. Cellular Automata, Universality of;Computational Complexity;2012