刘路 - 中南大学 - 数学与统计学院

个人简介

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. 教育经历 2012.9-2016.12 Central South University | Mathematics | 博士学位 | 博士研究生毕业 2008.9-2011.12 Central South University | Mathematics | 学士学位 | 大学本科毕业工作经历 2012.3-至今 Department of Mathematics and Statistics | Central South University > Researcher Researcher 2018.4-2019.1 Institute for Mathematical Sciences | National University of Singapore Visiting Research Fellow 2020.1-至今 Institute for Mathematical Sciences | National University of Singapore Senior Visiting Research Fellow 科研项目 [1]Computability property vs computational property,Finished,National Science Foundation of China [2]The algorithms and applications for high-dimentianl biomedical data,Central South University Innovation Program [3]Proof theory of Ramsian type Theorems,On going,Hunan Provincial Natural Science Foundation of China 教学成果 [1]Probability and Statistics (2015 Fall, 2019 Fall) [2]Functions of a complex variable and integral transformation (2017 Spring, 2019 Spring) [3]Linear Algebra (2017 Spring, 2019 Spring) [4]Mathematical Logic (2019 Fall) [5]Regression Analysis (2019 Fall) 获奖信息 [1]Undergraduate Students of the Year (2011 中国大学生年度人物) [2]2012影响世界华人奖-希望之星

近期论文

查看导师最新文章（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）

[1].RT22 does not imply WKL0:Journal of Symbolic Logic,2012,77(2):609-620 [2].Cone avoid closed sets:Transactions of the American Mathematical Society,367(3):1609-1630 [3].A computable analysis of variable words theorems.[J]:Proceedings of the American Mathematical Society,2019,147(2):823-834 [4].Extracting randomness within a subset is hard.[J]:European Journal of Mathematics,2019:1-14 [5].The Strength of Ramsey's Theorem For Pairs over trees: I. Weak K\"onig's Lemma:Arxiv 1912.09049 [6].Which DNR can be minimal:Arxiv 1912.09053 [7].Avoid Schnorr randomness:Arxiv 1912.09052