DZone
Thanks for visiting DZone today,
Edit Profile
  • Manage Email Subscriptions
  • How to Post to DZone
  • Article Submission Guidelines
Sign Out View Profile
  • Post an Article
  • Manage My Drafts
Over 2 million developers have joined DZone.
Log In / Join
  • Refcardz
  • Trend Reports
  • Webinars
  • Zones
  • |
    • Agile
    • AI
    • Big Data
    • Cloud
    • Database
    • DevOps
    • Integration
    • IoT
    • Java
    • Microservices
    • Open Source
    • Performance
    • Security
    • Web Dev
DZone >

Lecture by Sir Tony Hoare, Inventor of Quicksort

Peter Pilgrim user avatar by
Peter Pilgrim
CORE ·
Dec. 07, 12 · · Interview
Like (1)
Save
Tweet
7.16K Views

Join the DZone community and get the full member experience.

Join For Free

On Monday evening, 3rd December, 2012, I went along to the British Computer Society London in the Strand for a lecture from none other than Professor Sir Tony Hoare. It is not everyday you get meet a personality who has been so well deserved lauded in the computer science, in its history and its modernity and  brief time of existence. Tony Hoare was the inventor of the famous Quicksort computer algorithm in 1960 (at the age of 26). I remember a first encounter with the QuickSort algorithm in Herbert C. Schildt’s Programming in C book.

Professor Hoare was in town to give a Peter Landin lecture on Laws of Concurrent Design. The talk was essentially about mathematical calculus of computer programs; how they could be expressed in terms of mathematical functions, and set of basic axioms with rules, then could be composed together to proof notations about concurrency and sequential operations.

Professor Sir Tony Hoare at BCS London, December 2012

Oh gosh, it has been awful long time, since I personally looked at additional mathematics course book. Yet I understood this level of discourse in the talk. I found that I could understand the Exchange Axiom to my surprise. Although, I think Professor Hoare had simplified the actual formulas for the benefit of his talk and the level of the audience.

For the ordinary punter, dealing with this abstract mathematical terms is clearly out of the level of usefulness, however these are the theories that allows computer scientists to build programs such as compilers, static analysers and the tools that language writers use to build new programming languages in order to give us the world of devices and applications that we all use today. Without these pioneers in the computer programming arena, we would be, I think, far far behind. Indeed, we are standing, everyday, on the shoulders of giants and reaching for the stars.

I thoroughly enjoyed the Professor Hoare talk, and the fact that this guy is older than me and still working (at Microsoft Research in Cambridge, England) is inspiration enough to say to hell with silo management and bad attempts to be hip with the agile practices. Say hello to diversity in corporation, the future is for real. Here is a real star: a living legend.

Computer Computer programming Build (game engine) Book Algorithm Axiom (computer algebra system) application Law (stochastic processes) Arena (web browser) History (command)

Published at DZone with permission of Peter Pilgrim, DZone MVB. See the original article here.

Opinions expressed by DZone contributors are their own.

Popular on DZone

  • Which Backend Frameworks Are Impacting Web App Development Immensely?
  • Hard Things in Computer Science
  • DZone's Article Submission Guidelines
  • 7 Ways to Capture Java Heap Dumps

Comments

Partner Resources

X

ABOUT US

  • About DZone
  • Send feedback
  • Careers
  • Sitemap

ADVERTISE

  • Advertise with DZone

CONTRIBUTE ON DZONE

  • Article Submission Guidelines
  • MVB Program
  • Become a Contributor
  • Visit the Writers' Zone

LEGAL

  • Terms of Service
  • Privacy Policy

CONTACT US

  • 600 Park Offices Drive
  • Suite 300
  • Durham, NC 27709
  • support@dzone.com
  • +1 (919) 678-0300

Let's be friends:

DZone.com is powered by 

AnswerHub logo