为了纪念这位伟大的科学家,中国科学院软件所将在五月份举办题为“第九届计算模型的理论与应用大会”(9th Annual Conference on Theory and Applications of Models of Computation)。此次会议的目的是“把广大研究人员有关计算理论与应用的兴趣聚拢起来,其主旨在于探讨可计算性、复杂性以及算法,同时顾及这些成果向信息与网络的延伸。”究竟有多广泛呢?我们可以从会议罗列的题目中管窥一斑,当然其范围还远远不限于此:
算法代数(Algorithmic algebra,)
算法图论与组合组合数学(Algorithmic graph theory and combinatorics)
算法与数据结构(Algorithms and data structures)
近似算法(Approximation algorithms)
自动机和神经网络(Automata and neural networks)
计算生物学和生物信息学(Computational biology, and bio-informatics)
计算复杂性(Computational complexity)
计算博弈论、网络博弈论(Computational game theory, network game theory)
计算几何(Computational geometry)
可计算数学(Computable mathematics)
连续和实运算(Continuous and real computation)
密码学和复杂性(Cryptography and complexity)
可判定下和不可判定性(Decidability and undecidability)
解随机化(Derandomization)
错误校正和局部可测编码(Error correcting code and locally testable codes)
互联网数学(Internet mathematics)
学习理论和智能计算(Learning theory, and intelligent computing)
数学性质的局部测试(Local test of mathematical properties)
计算和网络模型(Models of computing and networking)
自然计算(Natural computation)
网络算法(Network algorithms)
构建网络(Networking)
自然与社会网络-新法则和原则(Networks in nature and society - new laws and principles)
数论与编码理论(Number theory and coding theory)
在线算法和并行算法(On-line algorithms and parallel algorithms)
物理可计算性(Physical computability)
程序检查(Programm checking)
证明与计算(Proofs and computation)
量子计算(Quantum computing)
随机化算法(Randomized algorithms)
复杂类与自然中的随机性(Randomness in complexity classes and in nature)
相对可计算性和等级结构Relative computability and degree structures