Workshop in Recursion Theory and Complexity Theory to be held in Kazan, Russia in July, 1997

递归理论和复杂性理论研讨会将于1997年7月在俄罗斯喀山举行

• 批准号: 9707156
• 负责人: Steffen Lempp
• 金额: $ 1.55万
• 依托单位: University of Wisconsin-Madison
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1997
• 资助国家: 美国
• 起止时间: 1997-03-15 至 1998-02-28
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9707156&HistoricalAwards=false
• 关键词: Workshop; Recursion; Theory; Complexity; held

ABSTRACT: The proposal is to support travel by U. S. scientists to a one-week workshop in computability theory to be held in Kazan, Russia, in July 1997, to be organized by Profs. Marat Arslanov (Kazan State University) and Sergei Goncharov (Russian Academy of Sciences, Novosibirsk Branch) as well as Steffen Lempp (University of Wisconsin-Madison) and Robert Soare (University of Chicago). The proposed workshop (to be held jointly and at the same location as a workshop in complexity theory, organized by Profs. Razborov and Ablayev) is the first meeting of its kind, designed to allow close contact between approximately thirty Russian and thirty scientists from the U. S. and other Western countries. Computability theory, the study of unsolvable problems in mathematics, is a well-established branch of mathematical logic, and is particularly strongly represented in the United States and Russia. For obvious political reasons, interaction between the two countries in this area has been quite limited in the past. Research interests have also developed in somewhat different directions within the field; e. g., the emphasis in Russia is on applications of computability theory to algebra, whereas in the United States, classical computability theory is more dominant. On the other hand, close connections between the various directions obviously exist, as is evidenced by the small amount of cooperative research already taking place. While the political barriers have by now mostly disappeared, severe financial difficulties have proven to be almost as great an obstacle to mutual cooperation in the field. It thus appears that the only way to organize a meeting including a large number of Russians is to organize one within Russia, cutting travel expenses for Russian participants and counting on the non-Russian participants to be able to raise travel funds more easily.

摘要：该提案旨在支持美国科学家前往参加 1997 年 7 月在俄罗斯喀山举办的为期一周的可计算性理论研讨会，该研讨会由 教授组织。 Marat Arslanov（喀山国立大学）和 Sergei Goncharov（俄罗斯科学院新西伯利亚分院）以及 Steffen Lempp（威斯康星大学麦迪逊分校）和 Robert Soare（芝加哥大学）。 拟议的研讨会（将与复杂性理论研讨会在同一地点联合举行，由 Razborov 和 Ablayev 教授组织）是此类会议的第一次，旨在让大约 30 名俄罗斯科学家和 30 名来自俄罗斯的科学家进行密切接触。美国和其他西方国家。 可计算性理论是对数学中无法解决的问题的研究，是数理逻辑的一个完善的分支，在美国和俄罗斯尤为突出。 由于明显的政治原因，两国在这一领域的互动过去相当有限。 该领域内的研究兴趣也朝着不同的方向发展； e.例如，俄罗斯的重点是可计算性理论在代数中的应用，而在美国，经典可计算性理论更占主导地位。 另一方面，各个方向之间显然存在着密切的联系，已经进行的少量合作研究就证明了这一点。 尽管政治障碍现已基本消失，但事实证明，严重的财政困难几乎是该领域相互合作的巨大障碍。 因此，组织一次包括大量俄罗斯人的会议的唯一方法似乎是在俄罗斯境内组织一次会议，从而减少俄罗斯参与者的旅行费用，并指望非俄罗斯参与者能够更容易地筹集旅行资金。