In this episode of ACM ByteCast, our special guest host Scott Hanselman welcomes 2013 ACM A.M. Turing Award laureate Leslie Lamport of Microsoft Research

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.