[1] viXra:2607.0026 [pdf] submitted on 2026-07-08 12:53:22
Authors: Warren D. Smith
Comments: 8 Pages. On internet since 1997; uploading to VIXRA for archival purposes. Related paper: Molecular tinkertoys.
Three negative results:
All 3 of these facts are almost trivial from the viewpoint of modern computer science, but I don't think they've been mentioned in the chemical literature.
Positive results: We discuss algorithms for finding out how to solve the synthesis problem (of determining whether something is synthesizable, and what the best synthetic process is). An interesting generalization of the famous "shortest path problem" in directed graphs arises in which the paths become synthetic trees, the graphs become hypergraphs, and the distances become synthetic costs. This problem is soluble either by generalizing Dijkstra's algorithm or the dynamic programming algorithm. Despite the fact that these algorithms are highly efficient as a function of the size of the hypergraph, in practice because the hypergraph arising from chemistry is enormous, that is inadequate. We discuss methods for ameliorating this.
Category: Chemistry