Remarks on Computational Complexity: Response to Abels

Mind and Language 28 (4):430-434 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Comments on Hornstein.Klaus Abels - 2013 - Mind and Language 28 (4):421-429.
Computational complexity and Godel's incompleteness theorem.Gregory J. Chaitin - 1970 - [Rio de Janeiro,: Centro Técnico Científico, Pontifícia Universidade Católica do Rio de Janeiro. Edited by Gregory J. Chaitin.
The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
Computational vs. causal complexity.Matthias Scheutz - 2001 - Minds and Machines 11 (4):543-566.
Deterministic chaos and computational complexity: The case of methodological complexity reductions. [REVIEW]Theodor Leiber - 1999 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 30 (1):87-101.
On the unproductiveness of language and linguistics.David M. W. Powers - 2006 - Behavioral and Brain Sciences 29 (1):82-84.

Analytics

Added to PP
2013-09-03

Downloads
68 (#235,492)

6 months
10 (#255,509)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Norbert Hornstein
Harvard University

Citations of this work

No citations found.

Add more citations

References found in this work

Vision.David Marr - 1982 - W. H. Freeman.

Add more references