Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Theory Of Computation (F) > Computation By Abstract Devices (F.1) > Models Of Computation (F.1.1) > Unbounded-Action Devices (F.1.1...)  
 
Options:
 
  1-10 of 46 Reviews about "Unbounded-Action Devices (F.1.1...)": Date Reviewed
  Designing beauty: the art of cellular automata
Adamatzky A., Martínez G., Springer International Publishing, New York, NY, 2016. 191 pp.  Type: Book (978-3-319272-69-6)

This book is a collection of 30 brief papers (with an average length of six pages), each containing images--art works--generated by different kinds of cellular automata, together with a collected comprehensive list of...

Apr 27 2016
   Game of life cellular automata
Adamatzky A., Springer Publishing Company, Incorporated, New York, NY, 2010. 621 pp.  Type: Book (978-1-849962-16-2)

When Martin Gardner published the rules of John Conway’s Game of Life four decades ago [1], the result was an explosion of interest in cellular automata among both amateur hobbyists and experienced researchers in compu...

Feb 23 2011
  Simulating complex systems by cellular automata
Hoekstra A., Kroc J., Sloot P., Springer Publishing Company, Incorporated, New York, NY, 2010. 384 pp.  Type: Book (978-3-642122-02-6)

To most computer scientists, the term cellular automata (CA) is associated with John Conway’s Game of Life. While this association is understandable, over the past ten to 15 years, CA have been used to study a variety ...

Feb 15 2011
  Cellular automata: a discrete view of the world (Wiley Series in Discrete Mathematics & Optimization)
Schiff J., Wiley-Interscience, 2007. 272 pp.  Type: Book, Reviews: (2 of 2)

Cellular automata (CA) are very interesting computational models that have become quite well known in recent years. Mathematical and computational scientists have at least heard of Conway’s Game of Life. Quite a few researche...

Jan 30 2009
  Cellular automata: a discrete view of the world (Wiley Series in Discrete Mathematics & Optimization)
Schiff J., Wiley-Interscience, 2007. 272 pp.  Type: Book, Reviews: (1 of 2)

In Schiff’s words, this book is “an introduction into the brave new world of cellular automata, hitting the highlights as the author sees them.” It is divided into six chapters: “Preliminaries,&a...

Nov 11 2008
  Crossing information in two-dimensional sandpiles
Gajardo A., Goles E. Theoretical Computer Science 369(1): 463-469, 2006.  Type: Article

In 1999, Moore and Nilsson [1] demonstrated that, in lattice graphs of dimension d ≥ 3, the problem of predicting the state of a sandpile after n time steps is polynomial time (P) complete, ...

Jun 6 2007
  Circuits on cylinders
Hansen K., Miltersen P., Vinay V. Computational Complexity 15(1): 62-81, 2006.  Type: Article

The path-breaking results of Furst, Saxe, and Sipser and of Ajtai in the early 1980s established that polynomial-sized constant depth circuits AC0 cannot compute PARITY. Since then, the small circuit classes AC0, ...

Nov 6 2006
  Cellular computing (Series in Systems Biology)
Amos M., Oxford University Press, 2004. 240 pp.  Type: Book (9780195155396)

This book is dedicated to an emerging discipline at the intersection of biology, computer science, and engineering: cellular computing. The vital component of this new discipline is engineering, which gives great practical importance t...

Feb 28 2006
  Cellular automata computations and secret key cryptography
Seredynski F., Bouvry P., Zomaya A. (ed) Parallel Computing 30(5-6): 753-766, 2004.  Type: Article

Cellular automata have the advantage of being amenable to the use of highly parallel and distributed system configurations, and, therefore, have attracted the attention of many researchers in recent years, most notably S. Wolfram....

Oct 7 2004
  Pushdown cellular automata
Kutrib M. Theoretical Computer Science 215(1/2): 239-261, 1999.  Type: Article

Kutrib introduces a new computing model called pushdown cellularautomata, which is obtained by replacing finite automata in traditionalcellular automata with pushdown automata. Natural restrictions of thismodel, called real-time and li...

Jan 1 2000
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy