Advice for Ph.D. students from Tony Hoare

At the International Summer School Marktoberdorf Tony Hoare was asked to give the talk at the closing session. He gave a lot of advices for Ph.

"There are two methods in software design. One is to make the program so simple, there are obviously no errors. The other is to make it so complicated, there are no obvious errors.", Tony Hoare

"There are two methods in software design. One is to make the program so simple, there are obviously no errors. The other is to make it so complicated, there are no obvious errors.", Tony Hoare

Tony Hoare Doctor Honoris Causa por la Universidad Complutense / David de Frutos + Ricardo Peña + El Año de Turing blog [http://blogs.elpais.com/turing] + @elpais_sociedad | #science

Tony Hoare Doctor Honoris Causa por la Universidad Complutense

Tony Hoare Doctor Honoris Causa por la Universidad Complutense / David de Frutos + Ricardo Peña + El Año de Turing blog [http://blogs.elpais.com/turing] + @elpais_sociedad | #science

Quicksort or partition-exchange sort is aptly named because, when properly implemented, it is the fastest known general-purpose in-memory sorting algorithm in the average case. Quick sort is a sorting algorithm developed by Tony Hoare that, on average, makes O(n log n) comparisons to sort n items.  #datastructure #quicksort #javaprogramming #cprogramming

Quicksort or partition-exchange sort is aptly named because, when properly implemented, it is the fastest known general-purpose in-memory sorting algorithm in the average case. Quick sort is a sorting algorithm developed by Tony Hoare that, on average, makes O(n log n) comparisons to sort n items. #datastructure #quicksort #javaprogramming #cprogramming

peru butterflies | Daedalma vertex , northern Peru © Tony Hoare

peru butterflies | Daedalma vertex , northern Peru © Tony Hoare

#Quicksort or partition-exchange sort is aptly named because, when properly implemented, it is the fastest known general-purpose in-memory sorting algorithm in the average case. Quick sort is a sorting algorithm developed by Tony Hoare that, on average, makes O(n log n) comparisons to sort n items. http://blog.geekboots.com/2014/11/quick-sort.html

#Quicksort or partition-exchange sort is aptly named because, when properly implemented, it is the fastest known general-purpose in-memory sorting algorithm in the average case. Quick sort is a sorting algorithm developed by Tony Hoare that, on average, makes O(n log n) comparisons to sort n items. http://blog.geekboots.com/2014/11/quick-sort.html

The home of computer scientist Sir Tony Hoare

The home of computer scientist Sir Tony Hoare

Read about Tony Hoare and John Hammonds journey through the Broken Group Islands in the latest issue of Canoe & Kayak.  For Canoe & Kayak and hundreds of other titles visit http://readrapp.com/

Read about Tony Hoare and John Hammonds journey through the Broken Group Islands in the latest issue of Canoe & Kayak. For Canoe & Kayak and hundreds of other titles visit http://readrapp.com/

Visualizing Concurrency in Go ·  divan's blog    One of the strongest sides of Go programming language is a built-in concurrency based on Tony Hoare’s CSP paper. Go is designed with concurrency in mind and allows us to build complex concurrent pipelines. But have you ever wondered - how various concurrency patterns look like?

Visualizing Concurrency in Go · divan's blog One of the strongest sides of Go programming language is a built-in concurrency based on Tony Hoare’s CSP paper. Go is designed with concurrency in mind and allows us to build complex concurrent pipelines. But have you ever wondered - how various concurrency patterns look like?

Pinterest
Search