History of Cybernetic and Dieter Stein

Geschichte: Dieter Stein ist der Mastermind der Website Cybernetics Tomorrow
Seine Karriere ist eng mit Cybernetics verknüpft

1940 Born 1940 in Austria

At the same Time Norbert Wiener wrote his book Cybernetics

197x Foundation of the Stein Software Gmbh in Germany

pharmaceutical industry

Hierarchische Strukturen

Lochkarten

1985 Colored Maps

In 1985 Dieter Stein developed colored maps that attracted great interest in the pharmaceutical industry. Adjacent is a map from 1985 that uses colors to show sales success in employee areas and uses the color pattern to indicate whether sales were improving or declining.

Stein took a terminal cable from his Siemens mainframe, connected it to an Amiga home computer, and wrote the necessary transmission protocols and programs.
Since then, he has studied the 4-color conjecture in depth. Finally, in 2010, Stein discovered the algorithm for coloring with 4 colors, but he did’nt find practical applications.

This video dates back to 2012.

The graph shown was constructed by combining the two graphs associated with the history of the Four Color Theorem mentioned earlier: the Errea graph (left) and the Heawood graph (right). These graphs were used by the mathematicians who discovered them to demonstrate that the proof originally proposed by Alfred Kempe was flawed.

The video shows the step-by-step coloring of the graph, node by node, repeating the process six times. This results in a total of six distinct yet valid colorings. (There are approximately 1,000 alternative valid colorings for these graphs.)

AI can also be used to color graphs, but the AI ​​will also have the problem of finding the right color variant. After all, in a cryptosystem, the sender’s computer must color the stone ball the same as the receiver’s computer. Aside from that, a comparable cryptosystem that requires AI to do this would depend on an available internet connection.

Intevention 4-coloured Network

SteinGraph

The SteinGraph algorithm can be used in the SteinCrypt cryptography system and for the self-organization of drone swarms in SteinSwarm.

The algorithm has become an important tool in graph theory.

The four colors represent the capacity to impose structure on a collection of elements and to assign one of four properties to each individual element.

These properties are distributed evenly across the elements, offering numerous advantages. For instance, graphs can be split and multiple graphs merged while maintaining an even distribution of properties.

If the word „element“ is replaced with „atom,“ „molecule,“ or „molecular compound,“ it becomes evident that this capability for structuring and self-organization could also be of interest in physics, chemistry, and organic chemistry.

Further potential applications arise when edge lengths are recorded within the graphs of scanned 3D objects and the vertices are colored using the SteinGraph algorithm.

In this way, the graph serves as a certificate of authenticity for intellectual property. If, for example, the head of a structure is illegally copied, the original coloring of the head no longer matches, as the colors shift due to the newly introduced surfaces. Even if the head is correctly recolored, it remains easy to demonstrate that the 3D surface of the head is a copy derived from the original structure.

Certificates of authenticity for patented technical objects could be created in the same manner.