Many people claimed NSD to be very easy to read and understand, especially for beginners. This is probably quite true but maintaining NSD can be a problem for system designers. Unlike flowchart, NSD lumps all the symbols into one large block and does not use connectors between the symbols.

Contrary to flowchart which uses connectors, NSD provides a better structural approach of design where Goto should be avoided in structured programming. NSD provides simplicity and a compact overview of a program that can show some relationship nicely. NSD, in particular, provides visual aid and guides thinking about nested conditional structures.

Personally, I find that NSD is useful for rapid prototyping. It is quite simple and easy to draw a conceptual design before expanding into a flowchart. Modifying a stage or symbol in NSD is rather tedious compared to flowchart. On the other hand, after a careful and thorough investigation, I find NSD most suitable for structured system analysis, design and programming. NSD was designed with structured system analysis and design in mind as mentioned in the above paragraph, it has many advantages over flowchart despite of problem maintaining it. I think it is worth to study and to use it.

Here is an example of NSD and flowchart stating an algorithm to find a summation given by the equation:

If S > 100, then display k and tell the user that k is in range.

When I was doing shopping alone this evening, the idea flashed in my mind. I could use Mathematica to explore algorithmic art. So, I sat down in front of my Mac and explored. Here’s my first piece of algorithmic art . It is not comparable to what Jean has done but is definitely a good start. I can’t call myself algorist yet because I created no algorithm.

The following examples are two very simple mathematics equations. The plots demonstrate that mathematics can be visualized as art.

And here is the Mathematica code:

ArrayPlot[
 Table[Mod[Abs[((2 x + I y/5)^2)/5*Pi], 2], {x, -36,
   36}, {y, -36, 36}]]

This is the first color algorithmic art which I accidentally stumbled upon while I was trying to plot a directional field. I modified the plot equation and added colors to it.

The Mathematica code:

ArrayPlot[
 Table[Mod[Abs[(4 - 2 x)/(3 y^2 - 5)], 2], {x, -36, 36}, {y, -36,
   36}], ColorFunction -> "Rainbow"]

Leslie invented bakery algorithm but he insisted that he discovered it. He wrote

For a couple of years after my discovery of the bakery algorithm, everything I learned about concurrency came from studying it. … The bakery algorithm marked the beginning of my study of distributed algorithms.

He enthralls me with his attitude towards knowledge and learning. His discovery was the beginning of his study of distributed algorithms.

How many people find a solution to a problem, then continue to study the solution for years and learning from it?

Leslie gives me a new inspiration and a whole new perspective towards learning. After reading his paper about bakery algorithm, I have a clearer inspiration in distributed computing. If I choose to specialize in this field, I need more of such inspiration coming to burn a bigger fire.