My major area is Mathematical Logic, in particular, Computability Theory. My research studies the complexity of various sets or functions (mostly in terms of Turing degree). I analyze the complexity or encoding ability of various combinatorial notions to see how exactly does combinatorial condition affects the computational power. I'm interested in applying combinatorial technique to computability theory question.

暂无内容

暂无内容

暂无内容

暂无内容