supported by the National Key Research and Develpment Program of China under Grant No.2022YFA1304603;the NSERC(Natural Sciences and Engineering Research Council)Discovery of Canada under Grant No.OGP0046506,and KillamPrize.
As we celebrate the success of AI,it is necessary to investigate the boundaries of AI,a la Karl Popper,so that our society does not fall for misleading commercial claims,and prevent dangers of misusing AI.We chat with...
Relativization is a common feature shared by almost every language,which also needs to be analyzed from the contrastive perspective.Considering about the NPAH theory,two questions has been solved here:what are the sim...
support from the National Humanities and Social Sciences Foundation of China (Grant No. 15BYY070)
Following the movement/internal-merge analysis of English relativization,many linguists argue for a similar approach to Chinese relativization(believing that there is operator movement or head raising in the derivatio...
supported by Foundation for the Authors of National Excellent Doctoral Dissertation of China (Grant No.201018);National Natural Science Foundation of China (Grant No. 10801035);Ministry of Education of China (Grant No. 200802461004)
In the past twenty years,great achievements have been made by many researchers in the studies of chaotic behavior and local entropy theory of dynamical systems.Most of the results have been generalized to the relative...
Project supported by the NSF Grant of China;Guizhou Science Foundation
This paper introduces "almost correct" and "almost fast" exponential-time approximation algorithms,and studies relationships between the approximate and probabilistic complexity classes.Some re-sulis on incomparabilit...
Ⅰ. INTRODUCTIONA central problem in computational complexity is whether or not the polynomial-time hierarchy is proper. Balcázar, Book and Schning have studied this problem by considering relativization with respect...