𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computer simulation of immunological cellular automata: The Tsallis model

✍ Scribed by Matthias Deffner

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
347 KB
Volume
195
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Computational Complexity of Finit
On the Computational Complexity of Finite Cellular Automata
✍ K. Sutner πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N

First-order stochastic cellular automata
First-order stochastic cellular automata simulations of the lindemann mechanism
✍ Chad A. Hollingsworth; Paul G. Seybold; Lemont B. Kier; Chao-Kun Cheng πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 101 KB

## Abstract The Lindemann mechanism explains how apparent unimolecular chemical reactions arise from bimolecular collisions. In this mechanism an ingredient M activates reactants A through collisions, and the resulting activated species A\* can either decay to products P or be deactivated back to A