Differences between current version and previous revision of CharlesAntonyRichardHoare.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 3 | Last edited on Sunday, December 7, 2003 7:57:06 pm | by GlynWebster | |
| Older page: | version 2 | Last edited on Tuesday, December 2, 2003 2:25:47 pm | by AristotlePagaltzis | Revert |
@@ -1,13 +1,13 @@
One of the big names in ComputerScience.
;: There are two ways of constructing a software design: One way is to make it so simple that there are obviously no deficiencies and the other way is to make it so complicated that there are no obvious deficiencies. %%% ''— CharlesAntonyRichardHoare''
-It was him
who discovered QuickSort in 1960, which is perhaps the single most widely used [Algorithm] ever.
+It was he
who discovered QuickSort in 1960, which is perhaps the single most widely used [Algorithm] ever.
-He also described the formal logic system named after himself,
Hoare logic or Hoare calculus,
in his 1969 paper [An axiomatic basis for computer programming | http://portal.acm.org/citation.cfm?doid=363235.363259]. This system defines axioms which can be used to reason about computer programs,
in order to do such things as formally proving their correctness.
+He also described the formal logic system now known as
Hoare logic or Hoare calculus in his 1969 paper [An axiomatic basis for computer programming | http://portal.acm.org/citation.cfm?doid=363235.363259]. This system defines axioms which can be used to reason about computer programs in order to do such things as formally proving their correctness.
He now works at the [Microsoft Research Labs | http://www.research.microsoft.com/~thoare/].
----
CategoryPeople
