University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Materialization of Universal Turing Machines

Materialization of Universal Turing Machines

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

This talk has been canceled/deleted

Currently, a curious object adorns the lobby of the Isaac Newton Institute for Mathematical Sciences in Cambridge: a physical Turing machine constructed by Gisbert Hasenjaeger. Currently, a curious object adorns the lobby of the Isaac Newton Institute for Mathematical Sciences in Cambridge: a physical Turing machine constructed by Gisbert Hasenjaeger.

Hasenjaeger (1919-2006) was a German mathematician and logician and professor of logic at the universities of Muenster and Bonn in Germany. During the second world war, he was assigned to the central cryptographic unit of the German army and unwittingly competed with Alan Turing, as he was assigned the task of breaking the Enigma code (to test its security).

He did not find the vulnerabilities that Turing exploited in breaking the code, and later said: “Fortunately! Otherwise the war would have lasted even longer!”

In the 1950s and 1960s, Hasenjaeger built several demonstration models of Turing machines. The machine on display at the Newton Institute is a Turing machine with modifications by Moore and Wang.

Our speaker, Rainer Glaschick, investigated the details of the mechanism of this machine and other physical Turing machines that are at the Heinz Nixdorf MuseumsForum in Paderborn, Germany and will report on his experiences with these curious machines.

The lecture is public and anyone interested in Turing and computability is welcome to attend

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity