Contours, convex sets and cellular automata. IMPA mathematical publications. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 22--27, 2001. (Q2748516)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Contours, convex sets and cellular automata. IMPA mathematical publications. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 22--27, 2001. |
scientific article; zbMATH DE number 1659895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Contours, convex sets and cellular automata. IMPA mathematical publications. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 22--27, 2001. |
scientific article; zbMATH DE number 1659895 |
Statements
16 October 2001
0 references
interacting particles
0 references
cellular automata
0 references
contours
0 references
convex sets
0 references
Ising models
0 references
0 references
0.76145685
0 references
0.75146645
0 references
0.7492321
0 references
0.7487186
0 references
0 references
Contours, convex sets and cellular automata. IMPA mathematical publications. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 22--27, 2001. (English)
0 references
The book considers models of randomly interacting particles widely known as cellular automata. These models have a nice physical appealing and can be applied to several real systems. The author puts them on firm rigorous definitions. Several important results are proven while open problems are also pointed out. The method of contours, convex sets and algorithms are the main mathematical tools used along the work. It is a nice reading for both pure and applied mathematicians, as well as for theoretical physicists and computer scientists.
0 references
