2013
DOI: 10.1007/978-3-642-39521-5_2
|View full text |Cite
|
Sign up to set email alerts
|

When Almost Is Not Even Close: Remarks on the Approximability of HDTP

Abstract: This is the accepted version of the paper.This version of the publication may differ from the final published version. Abstract. A growing number of researchers in Cognitive Science advocate the thesis that human cognitive capacities are constrained by computational tractability. If right, this thesis also can be expected to have far-reaching consequences for work in Artificial General Intelligence: Models and systems considered as basis for the development of general cognitive architectures with human-like pe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…Complementing these efforts and completing the picture, and Besold and Robere (2013) provide an investigation into the computational complexity and approximability of the approach. 3 Viewing HDTP from the perspective of theoretical computer science as a tool for the computation of generalizations between domain theories by means of a special form of anti-unification (i.e., putting it under the umbrella of rewriting research), properties, such as computational complexity and approximability, will not necessarily play a central role in the evaluation of the overall approach and system.…”
Section: Computational Properties Of Analogy-making Using the Hdtp Frmentioning
confidence: 99%
See 2 more Smart Citations
“…Complementing these efforts and completing the picture, and Besold and Robere (2013) provide an investigation into the computational complexity and approximability of the approach. 3 Viewing HDTP from the perspective of theoretical computer science as a tool for the computation of generalizations between domain theories by means of a special form of anti-unification (i.e., putting it under the umbrella of rewriting research), properties, such as computational complexity and approximability, will not necessarily play a central role in the evaluation of the overall approach and system.…”
Section: Computational Properties Of Analogy-making Using the Hdtp Frmentioning
confidence: 99%
“…The advantage of this form of high-level characterization of limiting factors for models and theories lies in its generality and independence from particular implementation details, by this overcoming many of the aforementioned divisions and barriers within HLAI and cognitive systems research and allowing for the introduction of general principles and requirements. The work by and Besold and Robere (2013) moreover serves as a first worked out example of how a corresponding system analysis can look like and what kinds of results can, among others, be expected.…”
Section: Complexity and Approximability As Guiding Forces In Hlaimentioning
confidence: 99%
See 1 more Smart Citation