
The AOCR Project is still alive. It is currently focusing on the study of a graph theoretical problem, after having developed a precise explanation how this problem represents the organic synthesizability problem. The graph theoretical problem is generalized and extended to a model theoretical one. The achieved results are put together in a book. A first version of the book manuscript has already been terminated. It will be now throughly revised and also cleaned up from some inevitable mistakes, imprecisions and typos. This first version essentially limited itself to the decidability (and undecidability) results. The model theoretical part was introduced but kept at a very basic level. Now I decided with the next version in preparation to add a good amount of model theoretical results that I have achieved in the past years, in spite of the fact that they do not directly contribute much to the decidability issue. I will also try to better clarify in which way and under which circumstances the graph theoretical problem is the organic synthesizabilty problem, although this issue is not a mathematical one. Please consider that both the new version of the manuscript and its presentation on this web site are a work in progress and subject to change whenever the development of the work requires it. Luca Ermanni read more about this subject...
Below is an example that illustrates how the program works. More examples of computations can be found under AOCR Project.

