Bletchley Park
http://plus.maths.org/content/taxonomy/term/716
enTuring's papers stay at home
http://plus.maths.org/content/turings-papers-stay-home
<div class="field field-type-filefield field-field-abs-img">
<div class="field-items">
<div class="field-item odd">
<img class="imagefield imagefield-field_abs_img" width="100" height="100" alt="" src="http://plus.maths.org/content/sites/plus.maths.org/files/abstractpics/5/25_feb_2011_-_1055/icon-1.jpg?1298631335" /> </div>
</div>
</div>
<div class="field field-type-text field-field-abs-txt">
<div class="field-items">
<div class="field-item odd">
<p>Almost nothing tangible remains of the legendary Bletchley Park codebreaker Alan Turing. So when an extremely rare collection of papers relating to his life and work was set to go to auction last year, an ambitious campaign was launched to raise funds to purchase them for the Bletchley Park Trust and its Museum. The Trust has announced today that the collection has been saved for the nation as the National Heritage Memorial Fund (NHMF) has stepped in quickly to provide £213,437, the final piece of funding required.</p>
</div>
</div>
</div>
<p><a href="http://www-groups.dcs.st-and.ac.uk/~history/Biographies/Turing.html">Alan Turing</a> was one of the twentieth century's most influential mathematicians. He's regarded as the father of modern computer science, played a vital part in breaking the Germans' Enigma code during WW2, fundamental to the Allied victory, and his work in mathematical logic penetrated to the very foundations of maths. Arguably, his work has touched more lives than that of most other mathematicians. </p><p><a href="http://plus.maths.org/content/turings-papers-stay-home" target="_blank">read more</a></p>http://plus.maths.org/content/turings-papers-stay-home#commentsAlan TuringBletchley Parkcomputer scienceEnigmalogicFri, 25 Feb 2011 10:59:47 +0000mf3445432 at http://plus.maths.org/contentAlan Turing: ahead of his time
http://plus.maths.org/content/alan-turing-ahead-his-time
<div class="field field-type-text field-field-author">
<div class="field-items">
<div class="field-item odd">
Stefan Kopieczek </div>
</div>
</div>
<div class="field field-type-filefield field-field-abs-img">
<div class="field-items">
<div class="field-item odd">
<img class="imagefield imagefield-field_abs_img" width="100" height="100" alt="" src="http://plus.maths.org/content/sites/plus.maths.org/files/issue47/features/kopieczek/icon.jpg?1212274800" /> </div>
</div>
</div>
<div class="field field-type-text field-field-abs-txt">
<div class="field-items">
<div class="field-item odd">
Alan Turing is the father of computer science and contributed significantly to the WW2 effort, but his life came to a tragic end. <b>Stefan Kopieczek</b> explores his story. </div>
</div>
</div>
<div class="pub_date">June 2008</div>
<!-- plusimport -->
<br clear="all" />
<p><i>This article is the runner up of the schools category of the <a href="/issue47/winners.html">Plus new writers award 2008</a>. Students were asked to write about the life and work of a mathematician of their choice.</i></p>
<!-- FILE: include/rightfig.html -->
<div class="rightimage" style="width: 200px;"><img src="/issue47/features/kopieczek/Turing.jpg" alt="Alan Turing" width="200" height="230" />
<p>Alan Turing</p><p><a href="http://plus.maths.org/content/alan-turing-ahead-his-time" target="_blank">read more</a></p>http://plus.maths.org/content/alan-turing-ahead-his-time#commentsAlan Turingartificial intelligenceBletchley Parkcomputer sciencecryptographyEnigmahalting problemPlus new writers award 2008Turing MachineTuring testSat, 31 May 2008 23:00:00 +0000plusadmin2332 at http://plus.maths.org/contentCracking codes
http://plus.maths.org/content/cracking-codes
<div class="field field-type-text field-field-author">
<div class="field-items">
<div class="field-item odd">
Artur Ekert </div>
</div>
</div>
<div class="field field-type-filefield field-field-abs-img">
<div class="field-items">
<div class="field-item odd">
<img class="imagefield imagefield-field_abs_img" width="100" height="100" alt="" src="http://plus.maths.org/content/sites/plus.maths.org/files/issue34/features/ekert/icon.jpg?1109635200" /> </div>
</div>
</div>
<div class="field field-type-text field-field-abs-txt">
<div class="field-items">
<div class="field-item odd">
In the first of two articles, <b>Artur Ekert</b> takes a tour through the history of codes and the prospects for truly unbreakable quantum cryptography. </div>
</div>
</div>
<div class="pub_date">March 2005</div>
<!-- plusimport -->
<br clear="all" />
<p><i>"Few persons can be made to believe that it is not quite an easy thing to invent a method of secret writing which shall baffle investigation. Yet it may be roundly asserted that human ingenuity cannot concoct a cipher which human ingenuity cannot resolve..."</i></p>
<p align="right"><i>Edgar Alan Poe - "A few words on secret writing"; 1841</i></p><p><a href="http://plus.maths.org/content/cracking-codes" target="_blank">read more</a></p>http://plus.maths.org/content/cracking-codes#comments34Bletchley ParkCaesar shift cipherEnigmafrequency analysisone-time padpolyalphabetic cipherscytalesubstitution cipherVernam cipherTue, 01 Mar 2005 00:00:00 +0000plusadmin2263 at http://plus.maths.org/contentExploring the Enigma
http://plus.maths.org/content/exploring-enigma
<div class="field field-type-text field-field-author">
<div class="field-items">
<div class="field-item odd">
Claire Ellis </div>
</div>
</div>
<div class="field field-type-filefield field-field-abs-img">
<div class="field-items">
<div class="field-item odd">
<img class="imagefield imagefield-field_abs_img" width="100" height="100" alt="" src="http://plus.maths.org/content/sites/plus.maths.org/files/issue34/features/ellis/icon.jpg?1109635200" /> </div>
</div>
</div>
<div class="field field-type-text field-field-abs-txt">
<div class="field-items">
<div class="field-item odd">
During the Second World War, the Allies' codebreakers worked at Bletchley Park to decipher the supposedly unbreakable Enigma code. <b>Claire Ellis</b> tells us about their heroic efforts, which historians believe shortened the war by two years. </div>
</div>
</div>
<div class="pub_date">March 2005</div>
<!-- plusimport -->
<br clear="all" />
<p><i>As long ago as the Ancient Greeks, warring armies have encrypted their communications in an attempt to keep their battle plans a secret from their enemies. However, just as one side invented an ingenious new way to encipher its messages, so would its enemies discover a clever way of cracking that code.<p><a href="http://plus.maths.org/content/exploring-enigma" target="_blank">read more</a></p>http://plus.maths.org/content/exploring-enigma#comments34Alan TuringBletchley ParkEnigmaTue, 01 Mar 2005 00:00:00 +0000plusadmin2264 at http://plus.maths.org/content