基本信息
浏览量:6
职业迁徙
个人简介
My interest in the computational properties of random and generic sets goes back to my thesis. Unlike most people working in computational complexity theory, my understanding of randomness is based on measure theory and definability rather than compressibility.
Another long-term research interest is the Berman-Hartmanis Isomorphism Conjecture, which holds that all NP-complete sets are isomorphic under polynomial-time computable and invertable 1-1 reductions. Just for the record, I believe that the conjecture is false.
I’m currently coming up to speed on type theory, approaching it as a mash-up of formal logic and functional programming.
Another long-term research interest is the Berman-Hartmanis Isomorphism Conjecture, which holds that all NP-complete sets are isomorphic under polynomial-time computable and invertable 1-1 reductions. Just for the record, I believe that the conjecture is false.
I’m currently coming up to speed on type theory, approaching it as a mash-up of formal logic and functional programming.
研究兴趣
论文共 74 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
semanticscholar(2019)
引用0浏览0引用
0
0
Computational analysis of protein modular domain architectures (2011)
引用23浏览0EI引用
23
0
Learning random dnf over the uniform distribution (2008)
引用23浏览0EI引用
23
0
TAMC'07: Proceedings of the 4th international conference on Theory and applications of models of computation (2007): 542-+
mag(2006)
引用23浏览0引用
23
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn