课题基金 / 基金详情

Conference: 17th International Conference on Computability, Complexity and Randomness (CCR 2024)

Conference: 17th International Conference on Computability, Complexity and Randomness (CCR 2024)
会议:第十七届可计算性、复杂性和随机性国际会议(CCR 2024)
批准号:
2404023
负责人:
Johanna Franklin
金额:
$3.26万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2024
资助国家:
美国
项目状态:
已结题
起止时间:
2024-01-15 至 2024-12-31

项目摘要

项目成果

相似基金

相关文献

中文摘要
翻译
该奖项支持来自美国的早期研究人员和研究生参加2024年3月11日至15日在日本名古屋大学举行的第17届国际可计算性、复杂性和随机性会议(CCR 2024)。本系列会议的中心主题是研究数学和计算机科学的交叉点上的随机性。随机性是我们生活中一个自然的非正式概念,也是概率论中的一个正式的数学概念,但在这里,我们试图使用不同类型的算法来量化数学对象(如无限二进制字符串)可以具有的随机性级别。由于疫情使美国早期职业研究人员和研究生更难形成国际专业网络,现在他们能够旅行、分享工作,并与海外同事建立面对面的合作关系非常重要。可计算性、复杂性和随机性系列会议自2004年以来一直在进行,促进了算法随机性、复杂性理论和可计算性理论的研究,以及算法随机性在数学领域(如遍历理论和几何测量理论)以及其他可计算性理论领域(如可计算结构理论和逆数学)的应用。今年,我们正在寻求扩大这次会议的重点,并欢迎有效集合论和连续组合学等相关领域的研究人员。这是早期职业研究人员和研究生在演讲中展示自己的工作和接触新研究领域的常见场所,加速了他们的专业发展并加强了他们的研究网络。会议的网站是https://sites.google.com/view/ccr2024/home。这一奖项反映了国家科学基金会的法定使命,并通过使用基金会的学术价值和更广泛的影响审查标准进行评估,被认为值得支持。
英文摘要
This award supports the participation of early-career researchers and graduate students from the US at the 17th International Conference on Computability, Complexity and Randomness (CCR 2024), taking place March 11-15, 2024 at Nagoya University in Nagoya, Japan. The conferences in this series have as their central theme the study of randomness at the intersection of mathematics and computer science. Randomness is a natural informal notion in our lives and a formal, mathematical notion in probability theory, but here we seek to use different types of algorithms to quantify the levels of randomness that a mathematical object (such as an infinite binary string) can possess. Since the pandemic has made it far more difficult for American early-career researchers and graduate students to form international professional networks, it is extremely important for them to be able to travel, share their work, and build in-person collaborations with their colleagues abroad now.The Computability, Complexity and Randomness conference series has been ongoing since 2004 and promotes research in algorithmic randomness, complexity theory, and computability theory as well as applications of algorithmic randomness to areas of mathematics such as ergodic theory and geometric measure theory and other areas of computability theory such as computable structure theory and reverse mathematics. This year, we are seeking to extend the focus of this conference and welcome researchers in related areas such as effective set theory and continuous combinatorics. It is a common venue for early-career researchers and graduate students to present their own work in contributed talks and encounter areas of research that are new to them, accelerating their professional development and enhancing their research networks. The conference website can be found at https://sites.google.com/view/ccr2024/home .This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
海外基金