COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > From almost optimal algorithms to logics for complexity classes via listings and a halting problem

## From almost optimal algorithms to logics for complexity classes via listings and a halting problemAdd to your list(s) Download to your calendar using vCal - Chen, Y (Shanghai Jiao Tong University)
- Thursday 29 March 2012, 09:00-10:00
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact Mustapha Amrani. Semantics and Syntax: A Legacy of Alan Turing Let $C$ denote one of the complexity classes ``polynomial time,’’ ``logspace,’’ or ``nondeterministic logspace.’’ We introduce a logic $L© This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- bld31
Note that ex-directory lists are not shown. |
## Other listsMeeting the Challenge of Healthy Ageing in the 21st Century Bioinformatics joint CRI-BSU series Algebra and Representation Theory Seminar## Other talksPanel comparisons: Challenor, Ginsbourger, Nobile, Teckentrup and Beck Prof Murray Shanahan: Artificial Intelligence Transcription by influenza virus RNA polymerase: molecular mechanisms, cellular aspects and inhibition Arriva Trains Wales by Tom Joyner Revolution and Literature: Volodymyr Vynnychenko's Responses to the Ukrainian Revolution of 1918-1920 MOVED TO 28 JUNE 2018 It takes two to tango:platelet collagen receptor GPVI-dimer in thrombosis and clinical implications |