检索结果-内蒙古大学图书馆

The Logical complexity of Geometric Properties in the Plane

Journal of the ACM (JACM) 1970年第2期17卷 339-347页

作者： Hodes, Louis Department of Health Education and Welfare Division of Computer Research and Technology National Institutes of Health Public Health Service United States

The logical complexity of some geometrical properties such as convexity and congruence in the plane is considered. These properties are characterized by the length of formulas necessary to express them. The main results show that certain formulations of congruence, convexity, area, and connectedness have only “nonlinear” realizations. These results are easy consequences of a recent theorem of Specker. This work is related to the concept of order of a geometric property introduced by Minsky and Papert. There are some striking differences, however, which are due to the fact that order is a measure of local complexity, while the measure of complexity used here is global. There are some limitations on measuring complexity in this manner, as one sees through the use of a switching circuit and a computer program in order to recognize patterns. © 1970, ACM. All rights reserved.

关键词： artificial intelligence complexity of Boolean functions complexity of circuits complexity of congruence complexity of convexity geometrical complexity logical complexity logical design measures of complexity pattern recognition

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：