University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > On the strongly bounded Turing degrees of the computably enumerable sets

  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

On the strongly bounded Turing degrees of the computably enumerable sets

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/03/08

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

Social Mobility: Chavs, NEETs and McJobs CCI Conservation Seminars

Other talks

Singularities of Hermitian-Yang-Mills connections and the Harder-Narasimhan-Seshadri filtration Modelling mitochondrial dysfunction in Parkinson’s disease: mitophagy, calcium and beyond Frontiers in paediatric cancer research Recent Advances in Solid State Batteries and Beyond Li Technologies - Challenges for Fundamental Science The spin evolution of supermassive black holes Graph Legendrians and SL2 local systems The Digital Doctor: Hope, Hype, and Harm at the Dawn of Medicine’s Computer Age Are hospital admissions for people with palliative care needs avoidable and unwanted? Fields of definition of Fukaya categories of Calabi-Yau hypersurfaces “It’s like they’re speaking a different language!” Investigating an accidental resistance to school mathematics reform
 

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