.
Knowledge Based Algorithms, Fall 2003
 
"Ashes and Diamonds" is a list of a few "benzenoid" conjectures discussed in this class ending with the first diamondoid conjecture.
"Ashes and Diamonds II" is continuation of this list containing open conjectures about annihilation number and diamondoids.
 
In Spring 2004, I am going to teach an extension of this course: Tutorials with
The Slides sketch some of my views concerning the philosophy of conjecture-making programs in the context of Turing test, Penrose's "Shadows of the Mind" and Putnam's "Mathematics without Foundation". These issues are discussed further in Toward Fully Automated Fragments of Graph Theory, II and to a greater extent in the Postscript To Fully Automated Fragments of Graph Theory.
 
The web page of Craig Larson contains links to several lists of conjectures of Graffiti and DeLaVina's Graffiti.Pc, which was used by Gunnar Brinkman to teach graph theory at the University of Bielefeld.
The web page of DeLaVina contains a bibliography of papers about these programs and the resulting conjectures.
 
Examples are Forever are reminscences about Paul Erdos emphasizing his interactions with Graffiti.
 

side bar magnified

buckyball in a larger window
 
The graphics and form of this web site were designed by Ermelinda DeLaVina 2003.