Representation Operators and Computation

Author: Kitts B.

Source: Minds and Machines, Volume 9, Number 2, May 1999 , pp. 223-240(18)

Publisher: Springer

Abstract:

This paper analyses the impact of representation and search operators on Computational Complexity. A model of computation is introduced based on a directed graph, and representation and search are defined to be the vertices and edges of this graph respectively. Changing either the representation or the search algorithm leads to different possible complexity classes. The final section explores the role of representation in reducing time complexity in Artificial Intelligence.

Keywords: representation; redescription; recoding

Language: English

Document Type: Regular paper

Affiliations: 1: Department of Computer Science, Center for Complex System, Brandeis University, Waltham, MA. 02254. USA.

Publication date: 1999-05-01

• In this: publication
• By this: publisher
• In this Subject: Computer Science
• By this author: Kitts B.

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers