Department of Computer Science  

5th Annual Postgraduate Conference

in

Computer Science

Taoyang Wu

Logic & Semantics

The Complexity without Turing Machine

Abstract: Despite the successful story of P vs. NP--which is based on TM, there are a lot of other interesting topics/models in complexity theory and I would like to present some of them that are accessible to most of us-- the postgraduate students survived from the underground study.

 

Return to Conference Programme