Representation operators and computation

Minds and Machines 9 (2):223-240 (1999)
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
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,760
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

9 ( #155,825 of 1,098,956 )

Recent downloads (6 months)

6 ( #43,600 of 1,098,956 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.