Representation operators and computation

Minds and Machines 9 (2):223-240 (1999)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,154

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The role of representation in computation.Gerard O'Brien & Jon Opie - 2009 - Cognitive Processing 10 (1):53-62.

Analytics

Added to PP
2009-01-28

Downloads
94 (#221,399)

6 months
21 (#136,957)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Introduction to mathematical logic.Elliott Mendelson - 1964 - Princeton, N.J.,: Van Nostrand.
.J. L. McClelland & D. E. Rumelhart (eds.) - 1987 - MIT Press.
Précis of The creative mind: Myths and mechanisms.Margaret A. Boden - 1994 - Behavioral and Brain Sciences 17 (3):519-531.

Add more references