Parallel distributed processing: explorations in the microstructure of cognition, vol. 2: psychological and biological models
Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
Connections and symbols
The computational brain
Image and brain: the resolution of the imagery debate
Image and brain: the resolution of the imagery debate
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
The calculi of emergence: computation, dynamics and induction
Proceedings of the NATO advanced research workshop and EGS topical workshop on Chaotic advection, tracer dynamics and turbulent dispersion
Hypothesis-Driven Constructive Induction in AQ17-HCI: A Method and Experiments
Machine Learning - Special issue on evaluating and changing representation
CYC: a large-scale investment in knowledge infrastructure
Communications of the ACM
Rerepresenting and restructuring domain theories: a constructive induction approach
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
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.