Turing’s Evidence

Most accounts of Alan Turing’s time at Bletchley Park focus on his achievements in breaking the Enigma code but until 2012 little was known about his use of Bayesian methods to solve problems in cryptology. I give here a brief summary of how Turing approached one such problem following the historical summaries in Zabell [39] and Simpson [38].