论文部分内容阅读
计算机协会的计算理论会议是计算机科学方面的一个有权威性的会议,每年春末召开,今年是第十二届,地点在美国加州洛杉矶。这个会议的论文集素来是当代计算机科学发展方面的重要文献。今年的会议曾征集到几百篇论文,从中选出了四十馀篇。中国计算机科学家洪加威的报告《关于决定性空间完全性问题》也被大会录取。对中国来说这是第一次。完全性问题是理论计算机科学中非常重要的问题,它引起了许多学者的注意。完全性问题分为决定性的和非决定性的、时间的和空间的。其中决定性空间完全性问题多年来一直没有找到。洪加威的论文提出了一种新的方法从而找到了这种问题。其方法之巧妙与结果之精细赢得了普遍的赞赏。一些有名的学者表示:这是三天之中最精采的报告。
The Computer Society's Computing Theory Conference is an authoritative conference in computer science that takes place every spring at the end of this year and is the 12th of this year in Los Angeles, California. The proceedings of this conference have always been important documents in the development of contemporary computer science. Hundreds of papers have been collected at this year's conference, of which over forty were selected. Chinese computer scientist Hong Jiawei's report on the issue of decisive space is also accepted by the General Assembly. This is the first time for China. Completeness is a very important issue in theoretical computer science. It has drawn the attention of many scholars. The problem of completeness is divided into decisive and inconclusive, temporal and spatial. The decisive issue of the completeness of space has not been found for years. Hungarwee's thesis suggests a new way to find such a problem. The ingenuity of the method and the fineness of the result have won widespread appreciation. Some famous scholars said: This is the most brilliant report in three days.