skip to content

The computational complexity of small universal Turing machines

Presented by: 
D Woods CALTECH (California Institute of Technology)
Tuesday 17th April 2012 - 16:30 to 17:00
INI Seminar Room 2
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons