可计算性理论及其在算法信息论中的应用
序号 | 标题 | 类型 | 作者 |
---|---|---|---|
1 | The method of the Yu-Ding Theorem and its application | 期刊论文 | Fan, Yun| |
2 | 可计算性理论及其在计算机科学中的应用研究 | 奖励 | 喻良| |
3 | The strength of the projective Martin conjecture | 期刊论文 | Yu, Liang|Chong, C. T.|Wang, Wei| |
4 | BOUNDING NON-GL(2) AND REA | 期刊论文 | Yu, Liang|Ding, Decheng|Wang, Wei|Ambos-Spies, Klaus| |
5 | On initial segment complexity and degrees of randomness | 期刊论文 | Miller, Joseph S.|Yu, Liang| |
6 | TURING DEGREES AND THE ERSHOV HIERARCHY | 会议论文 | Yu, Liang|Yang, Yue|Stephan, Frank| |
7 | A Pi(1)(1)-UNIFORMIZATION PRINCIPLE FOR REALS | 期刊论文 | Chong, C. T.|Yu, Liang| |
8 | Higher Kurtz randomness | 期刊论文 | Nies, Andre|Kjos-Hanssen, Bjorn|Stephan, Frank|Yu, Liang| |
9 | Lowness of higher randomness notions | 期刊论文 | Chong, C. T.|Nies, Andre|Yu, Liang| |