Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Emergent computation : a festschrift for Selim G. Akl
Adamatzky A., Springer International Publishing, New York, NY, 2016. 643 pp. Type: Book (978-3-319463-75-9)
Date Reviewed: Aug 8 2017

The foreword, by David Rappaport and Kai Salomaa, is a very nice summary (five pages) of significant contributions made by Selim G. Akl in several areas of informatics during the course of a very productive career. (For the sake of transparency: I was a coauthor with him at one point in the early part of that career.) As the foreword shows, his body of work has addressed issues in parallel computation, parallel algorithms, unconventional computation, natural computation, computational geometry, and cryptography.

The body of the book is a set of 26 papers that also demonstrate a diversity of interests among Akl (who contributes as a coauthor to three of the papers), his students, his collaborators, his friends, and other researchers who contributed. The papers are largely standalone contributions, although there are some ideas that weave their way into more than one, such as universal computation (denied in a couple of different ways) and parallel computations of various kinds. Emergence involves relatively simple structures or processes collaborating to produce results that are perhaps unexpected, and certainly achievable without combining the elements into a larger whole. Emergence is a theme of the series of which this volume is a part, is included in the title of the volume, and is explicitly evident in most of the papers. For example, collections of context-free grammars are more expressive than the components on their own, and simple automata in large networks can produce surprising results. Other papers explore ideas without mathematical formalism, such as a paper on vehicular clouds that explores the shared use of the computing power in vehicles for purposes other than the immediate needs of the drivers. There are also a couple of papers showing the value of search algorithms for “games” such as physical maze solving and chess endgames with pawns.

The breadth of ideas makes this volume interesting reading for those who want an understanding of some of the diverse topics it covers, while the specific contributions will be of interest to specialists in the relevant areas. The complete table of contents can be found online (http://www.springer.com/gp/book/9783319463759).

The papers vary considerably in style--some are heavily mathematical, others more conceptual--and cover a wide range of topics. It is unfortunate that such a volume would appear without more attention to the details of editing and proofreading. For example, one paper opens with Akl being recognized for his many contributions in the abstract and ends with him being listed in the references as “Selim, G. A.”

Reviewer:  D. T. Barnard Review #: CR145463 (1710-0637)
Bookmark and Share
  Reviewer Selected
 
 
Parallel Architectures (C.1.4 )
 
 
Parallel Algorithms (G.1.0 ... )
 
 
People (K.2 ... )
 
 
Public Key Cryptosystems (E.3 ... )
 
 
Computational Geometry And Object Modeling (I.3.5 )
 
Would you recommend this review?
yes
no
Other reviews under "Parallel Architectures": Date
A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
Lubachevsky B., Mitra D. Journal of the ACM 33(1): 130-150, 1986. Type: Article
Jun 1 1986
iWarp
Gross T., O’Hallaron D., MIT Press, Cambridge, MA, 1998. Type: Book (9780262071833)
Nov 1 1998
Industrial strength parallel computing
Koniges A. Morgan Kaufmann Publishers Inc., San Francisco, CA,2000. Type: Divisible Book
Mar 1 2000
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy