Skip to content

Monthly Archives: April 2009

Sir Tony Hoare on the future of Computing Science

Thursday, April 30, 2009

Sir Tony Hoare on the future of Computing Science (CACM, March 2009):
I expect the future to be as wonderful as the past has been. There’s still an enormous amount of interesting work to do. As far as the fundamental science is concerned, we still certainly do not know how to prove programs correct. We need [...]

Filed in Algorithms, Computing Science, Methodology, Programming, Science | Tagged , , , , , | Comments (0)

A Calculational Proof of the Handshaking Lemma

Tuesday, April 7, 2009

In graph theory, the degree of a vertex A, d.A, is the number of edges incident with the vertex A, counting loops twice. So, considering graph 0 below, we have d.A=3, d.B=3, d.C=1, d.D=3, and d.E=2.
A well-known property is that every undirected graph contains an even number of vertices with odd degree. The result first [...]

Filed in Algorithms, Computing Science, Education, Mathematics, Methodology | Tagged , , , , , , , , , | Comments (2)