Let's #TalkConcurrency with Sir Tony Hoare
Here is our #TalkConcurrency interview with Sir Tony Hoare at the Department of Computer Science, Cambridge University. About Sir Tony Hoare Computer scientist Sir Tony Hoare FRS FREng is well-known for developing the sorting algorithm Quicksort in 1959/1960, which is a systematic method for placing the elements of an array in order. It is the most commonly used algorithm for sorting due to its speed, especially when compared with its related competitors. Quicksort is a comparison sort and sometimes referred to as “partition-exchange sort”. In addition to Quicksort, Sir Tony has a list of other achievements under his belt; Quickselect, Hoare logic, Communicating Sequential, Processes and Structured programming to name a few. In addition, he has won numerous awards and honours based on his brilliant work within the Computer Science field! This includes SIX Honourary Doctorates over the years and his Knighthood back in 2000. He is now the principal researcher at Microsoft Research in Cambridge and Emeritus Professor in the Department of Computer Science at Oxford University. Interview Date: 07.11.2018 Read the full transcript here: https://www.erlang-solutions.com/blog...

Let's #TalkConcurrency Panel Discussion with Sir Tony Hoare, Joe Armstrong, and Carl Hewitt

Hoare on inventing Quicksort

How 22-year-old Tony Hoare invented Quicksort, one of the fastest and most used sorting algorithms

Eric Shull: Communicating Sequential Processes (September 22, 2015)

The Laws of Programming with Concurrency

Concurrency is not Parallelism by Rob Pike

Hoare on communicating sequential processes

John Cleese’s Brillian Take on Religion & 'Life of Brian' | The Dick Cavett Show

Tony Hoare, 1980 ACM Turing Award Recipient

Co-Creator of Haskell: Functional Programming, Thinking in Types, Useless Languages | Simon Jones

1966: Alan Turing's Machines | Mathematics in Action | BBC Archive

Sir Tony Hoare: Pioneers of Computer Science 11 November 2015

The forgotten advantages of concurrency (Let's #TalkConcurrency - QU2)

How To Think SO CLEARLY People Assume You're A Genius

Edsger W. Dijkstra - Lecture: Reasoning About Programs - Solving 2 problems using programing - 1990

Train Your Brain to Never Forget (5 Feynman Habits)

How we program multicores - Joe Armstrong

Busy Beaver Turing Machines - Computerphile

Edward Witten - How is Mathematics Truth and Beauty?
![Carmen Andoh - Communicating Sequential Processes [PWL NYC]](https://i.ytimg.com/vi/av3dYv0UM_s/hqdefault.jpg?sqp=-oaymwEjCNACELwBSFryq4qpAxUIARUAAAAAGAElAADIQj0AgKJDeAE=&rs=AOn4CLALKPwd2ilhWj3gIxNHJb6C4JbEuw)
