In this collaboration with ACM ByteCast and Hanselminutes, Scott welcomes 2013 ACM A.M. Turing Award laureate Leslie Lamport of Microsoft Research, best known for his seminal work in distributed and concurrent systems, and as the initial developer of the document preparation system LaTeX and the author of its first manual. Among his many honors and recognitions, Lamport is a Fellow of ACM and has received the IEEE Emanuel R. Piore Award, the Dijkstra Prize, and the IEEE John von Neumann Medal.
Leslie shares his journey into computing, which started out as something he only did in his spare time as a mathematician. Scott and Leslie discuss the differences and similarities between computer science and software engineering, the math involved in Leslie’s high-level temporal logic of actions (TLA), which can help solve the famous Byzantine Generals Problem, and the algorithms Leslie himself has created. He also reflects on how the building of distributed systems has changes since the 60s and 70s.
Subscribe to the ACM ByteCast at https://learning.acm.org/bytecast)
Time-Clocks Paper http://lamport.azurewebsites.net/pubs/time-clocks.pdf)
Bakery Algorithm https://en.wikipedia.org/wiki/Lamport%27s_bakery_algorithm)
Mutual Exclusion Algorithm https://en.wikipedia.org/wiki/Lamport%27s_distributed_mutual_exclusion_algorithm)
