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

会议：第十七届可计算性、复杂性和随机性国际会议（CCR 2024）

• 批准号: 2404023
• 负责人: Johanna Franklin
• 金额: $ 3.26万
• 依托单位: Hofstra University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2024
• 资助国家: 美国
• 起止时间: 2024-01-15 至 2024-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2404023&HistoricalAwards=false
• 关键词: Conference; 17th; International; Computability; Complexity

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.

该奖项支持来自美国的早期职业研究人员和研究生参加2024年3月11日至15日在日本名古屋的名古屋大学举行的第17届可计算性，复杂性和随机性国际会议（CCR 2024）。本系列会议的中心主题是数学和计算机科学交叉点的随机性研究。随机性在我们的生活中是一个自然的非正式概念，在概率论中是一个正式的数学概念，但在这里，我们试图使用不同类型的算法来量化数学对象（如无限二进制字符串）可以拥有的随机性水平。由于疫情使美国早期职业研究人员和研究生更难形成国际专业网络，因此现在能够旅行、分享工作并与国外同事建立面对面合作对他们来说极其重要。可计算性、复杂性和随机性会议系列自2004年以来一直在进行，并促进了算法随机性的研究，复杂性理论和可计算性理论，以及算法随机性在数学领域的应用，如遍历理论和几何测度理论，以及可计算性理论的其他领域，如可计算结构理论和逆向数学。今年，我们正在寻求扩大本次会议的重点，并欢迎相关领域的研究人员，如有效集理论和连续组合学。这是一个共同的场所，为早期职业研究人员和研究生介绍自己的工作，在贡献的会谈和遇到的研究领域是新的给他们，加速他们的专业发展，并加强他们的研究网络。https://sites.google.com/view/ccr2024/home该奖项反映了NSF的法定使命，并被认为值得通过使用基金会的知识价值和更广泛的影响审查标准进行评估来支持。