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)|
|Through your library||Configure|
Similar books and articles
Shimon Edelman (1995). Representation, Similarity, and the Chorus of Prototypes. Minds and Machines 5 (1):45-68.
Reza Zamani (2010). An Object-Oriented View on Problem Representation as a Search-Efficiency Facet: Minds Vs. Machines. [REVIEW] Minds and Machines 20 (1):103-117.
Chrysafis Hartonas (1997). Duality for Lattice-Ordered Algebras and for Normal Algebraizable Logics. Studia Logica 58 (3):403-450.
Robert S. Stufflebeam (1997). Why Computation Need Not Be Traded Only for Internal Representation. Behavioral and Brain Sciences 20 (1):80-81.
Robert C. Cummins & Georg Schwarz (1987). Radical Connectionism. Southern Journal of Philosophy Supplement 26 (S1):43-61.
Andrew R. Bailey (1994). Representations Versus Regularities: Does Computation Require Representation? Eidos 12 (1):47-58.
B. Maclennan (2003). Transcending Turing Computability. Minds and Machines 13 (1):3-22.
Added to index2009-01-28
Total downloads3 ( #213,351 of 722,839 )
Recent downloads (6 months)0
How can I increase my downloads?