基本信息
浏览量:43
职业迁徙
个人简介
Positions
I have research assistant positions available for Ph.D. students. If you are interested in my research, please contact me and describe the sort of projects you are interested in doing. For anyone interested in graduate school, I recommend reading this advice on how to prepare: Mor Harchol-Balter's advice and Matt Might's advice.
Research Interests
Molecular computing (e.g., algorithmic self-assembly, chemical reaction networks)
Theoretical computer science (e.g., distributed computing, algorithmic information theory, computational complexity)
I am broadly interested in problems at the intersection of physics, chemistry, biology, and computation. By this I do not mean the traditional "computation in service of natural science" (e.g., bioinformatics, computational chemistry, or molecular dynamics simulation). Rather, certain molecular systems — such as a test tube of reacting chemicals, a genetic regulatory network, or a growing crystal — can be interpreted as doing computation themselves. I want to understand the fundamental logical and physical limits to computation by such means.
I have worked in algorithmic self-assembly, such as the tile assembly model developed by Erik Winfree, and computation using chemical reactions. DNA nanotechnology, pioneered by Ned Seeman, is a field focused on using artificial DNA strands to assemble nanoscale structures and dynamic systems such as logical circuits. Experimental work in that field informs many of the questions that interest me.
Furthermore, there are deep connections between realistic physical models and existing models of computation. For example, chemical reaction networks are related to a model of distributed computing known as population protocols (as well as an older model of concurrent processes known as Petri nets), and the tile assembly model has connections to Wang tiling and cellular automata.
Formerly (and possibly in the future) I studied methods of measuring information and the extent to which computation on objects is capable of altering their information content. My research in this direction is in an area in which theoretical computer science intersects with fractal geometry and information theory, known as effective fractal dimension, developed by Jack Lutz. I am also interested in another area known as computational depth, which is a different notion of algorithmic information developed by Charles Bennett.
研究兴趣
论文共 82 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
CoRR (2023): 8:1-8:22
引用0浏览0EI引用
0
0
ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer scienceno. 3 (2023): 22:1-22:61
DNApp.7:1-7:23, (2023)
引用0浏览0EI引用
0
0
CoRR (2023): 9:1-9:16
引用0浏览0EI引用
0
0
Symposium on Algorithmic Foundations of Dynamic Networks (SAND)pp.13:1-13:18, (2022)
David Doty, Aaron Ong
Symposium on Algorithmic Foundations of Dynamic Networks (SAND) (2022): 14:1-14:15
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn