广义量词的计算复杂性 |
| |
引用本文: | 张晓君.广义量词的计算复杂性[J].毕节学院学报,2015(4):60-64. |
| |
作者姓名: | 张晓君 |
| |
作者单位: | 四川师范大学政治教育学院,四川 成都,610066 |
| |
基金项目: | 国家社会科学基金西部项目“汉语语句系统的逻辑语义学研究”,项目编号13XYY016。 |
| |
摘 要: | 广义量词的复杂性有两个层次:句法层面的复杂性和语义层面的复杂性,我们集中研究了广义量词的语义复杂性。在有穷的语境中可以找出自然语言量化语句真值的复杂性。这些复杂性与图灵机中的可计算性、作为算法的意义的等价性、计算复杂性、易处理性和不易处理性等内容相关。广义量词计算复杂性已有诸多相关研究成果。
|
关 键 词: | 广义量词 计算复杂性 算法 可计算性 |
Computational Complexity of Generalized Quantifiers |
| |
Abstract: | There are two levels of complexity of generalized quantifiers syntactic level and semantic level. The paper focuses on complexity of semantic of generalized quantifiers. The complexity of the truth-val?ues of natural language quantified sentences can be found in finite situations. The complexity is related to oth?er contents, such as computability in Turing machines, identify of meanings-as algorithms, computational com?plexity, tractability and intractability. There are many related fruits in computational complexity of generalized quantifiers. |
| |
Keywords: | Generalized Quantifiers Computational Complexity Algorithms Computability |
本文献已被 万方数据 等数据库收录! |