Pułapki komputacjonizmu

Filozofia Nauki 1 (2004)
  Copy   BIBTEX

Abstract

The paper concerns basic restrictions (and also simplifications and misinterpretations) which happens when one tries to explain mind processes (especially cognitive ones) by an analogy to formal, algorithmical and anticipated computation processes. The paper puts together the most important reasons why these attempts come to grief. The essence of computative reduction is shown among other things on the basic theorems of modern metamathematics. Especially it gives prominence epistemological consequences Gödel's theorems and recent discovers in metamathematics made by Gregory J. Chaitin. But simplifications of computationisme (and partly of whole cognitivisme) don't mean that the other way is only postmodernism

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-03-14

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references