Sounds like a nice undergrad thesis to re-implement this computation using modern programming styles in a modern programming language. At 09:34 AM 4/29/2013, Thane Plambeck wrote:
So, is there some modern source-code implementation of this computation that a person can play with?
On Apr 29, 2013, at 9:06 AM, Guy Haworth <g.haworth@reading.ac.uk> wrote:
Sad news indeed ... but his work lives on, and fascinating it was.
To work out what 1,200 hours of 1976 computing is today, maybe one can just divide by four for every three years, so that's *0.25^12 ... or less than one second.
However, the algorithm admitted of 'embarrassing parallelism' whereby many independent parts of the proof (one for each subsetted subgraph) could be carried out in parallel.
So, one need not wait even one second if there's a hurry on!
Guy