University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > The program-size complexity of universal Turing machines

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

The program-size complexity 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.

Semantics and Syntax: A Legacy of Alan Turing

2012/04/17

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:

Note that ex-directory lists are not shown.

Other lists

Innovation Forum Book Launches Cambridge Journal of Regions, Economy and Society

Other talks

Stereodivergent Catalysis, Strategies and Tactics Towards Secondary Metabolites as enabling tools for the Study of Natural Products Biology Eurostar with Philippe Mouly Cambridge-Lausanne Workshop 2018 - Day 2 Cellular recycling: role of autophagy in aging and disease Acceleration of tropical cyclogenesis by self-aggregation feedbacks Auxin, glucosinolates, and drought tolerance: What's the connection? Single Cell Seminars (October) A feast of languages: multilingualism in neuro-typical and atypical populations Amino acid sensing: the elF2a signalling in the control of biological functions The Gopakumar-Vafa conjecture for symplectic manifolds
 

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