Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Minds and Machines
Erschienen in: Minds and Machines 2/2011

01.05.2011

Philosophy of Mind Is (in Part) Philosophy of Computer Science

verfasst von: Darren Abramson

Erschienen in: Minds and Machines | Ausgabe 2/2011

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper I argue that whether or not a computer can be built that passes the Turing test is a central question in the philosophy of mind. Then I show that the possibility of building such a computer depends on open questions in the philosophy of computer science: the physical Church-Turing thesis and the extended Church-Turing thesis. I use the link between the issues identified in philosophy of mind and philosophy of computer science to respond to a prominent argument against the possibility of building a machine that passes the Turing test. Finally, I respond to objections against the proposed link between questions in the philosophy of mind and philosophy of computer science.
Vorheriger Artikel Descartes Among the Robots
Nächster Artikel Do Accelerating Turing Machines Compute the Uncomputable?

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Fußnoten
1
A machine can pass the Turing test if its verbal behavior in a text-mediated format is indistinguishable, on average and in the long run, from that of a human being. See Turing (1950).
 
2
I define these theses below.
 
3
A quantum computer is a physical device in which computation relies on ‘qubits,’ or physical states that both encode information, and are in a state of superposition. See Hagar (2010).
 
4
In essence, such a scenario would result in a computer having a locally infinite amount of time to complete its computation, while to an observer the same computation would appear to take a finite amount of time.
 
5
Due to copyright restrictions governing the systems emulated, websites offering such services come and go quickly. For a selection of such sites, one can Google the terms ‘web based emulator.’
 
6
For example, consider work supporting the so-called ‘enactive theory of perception’ as presented, for example, in Noë (2004).
 
7
The Wachowski brothers directed, produced, and wrote the scripts for the Matrix movie trilogy.
 
8
I have avoided in this paper discussion of computational functionalism: the theory that having a mind is nothing more than implementing a particular computer. If true, then building minds involves nothing more than building computers. Arguably, too, issues in philosophy of mind can then be subsumed under the philosophy of computer science.
 
Literatur
Abramson, D. (2006a). Church’s thesis and philosophy of mind. In Church’s Thesis after 70 Years. Ontos Verlag.
Abramson, D. (2006b). Computability and mind. Unpublished doctoral dissertation. Indiana University: Department of Philosophy, Program in Cognitive Science.
Abramson, D. (2008). Turing’s responses to two objections. Minds and Machines, 18(2), 147–167.
Abramson, D. (forthcoming). Descartes’s influence on Turing. Studies in History and Philosophy of Science.
Copeland, J., & Sylvan, R. (1999). Beyond the universal Turing limit. Australasian Journal of Philosophy, 77(46–66).
Cotogno, P. (2003). Hypercomputation and the physical Church-Turing thesis. British Journal for the Philosophy of Science, 54, 181–223.
Cottingham, J. (1992). Cartesian dualism: Theology, metaphysics, and science. In: Cottingham, J. (Ed.), The Cambridge Companion to Descartes. Cambridge: Cambridge University Press.CrossRef
Cummins, R., Blackmon, J., Byrd, D., Poirier, P., Roth, M., & Schwarz, G. (2001). Systematicity and the cognition of structured domains. Journal of Philosophy, 98, 167–185.CrossRef
Denker, J. S., & leCun, Y. (1992). Natural versus “universal” probability, complexity, and entropy. AT&T Technical Memorandum. Republished in the proceedings of the 1992 IEEE Workshop on the Physics of Computation.
Descartes, R. (1985/1637). Principles of philosophy. In The philosophical writings of Descartes, Vol. I (J. Cottingham, R. Stoothoff & D. Murdoch, Trans.). Cambridge: Cambridge University Press.
Deutsch, D. (1985). Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A, 400, 97–117.MathSciNetMATHCrossRef
French, R. M. (2000). Peeking behind the screen: The unsuspected power of the standard Turing Test. Journal of Experimental and Theoretical Artificial Intelligence, 12(3), 331–340.MATHCrossRef
Gandy, R. (1980). Studies in logic and the foundations of mathematics, Chapter Church’s Thesis and principles for mechanisms (pp. 123–148). Amsterdam, New York: North-Holland Publishing.
Hagar, A. (2010). Quantum computing. In E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy. Spring 2010 edition.
Hamkins, J. D. (2002). Infinite time Turing machines. Minds and Machines, 12, 521–539.MATHCrossRef
Lucas, J. (1961). Minds, machines, and Gödel. Philosophy XXXVI, 112–127.MATH
McCarty, D. C. (1987). Variations on a thesis: Intuitionism and computability. Notre Dame Journal of Formal Logic, 28(4), 536–580.MathSciNetMATHCrossRef
Noë, A. (2004). Action in perception. Cambridge, MA: MIT Press.
Ord, T., & Kieu, T. D. (2005). The diagonal methods and hypercomputation. British Journal for the Philosophy of Science, 56, 147–156.MathSciNetMATHCrossRef
Penrose, R. (1994). Shadows of the mind. London: Vintage.
Shagrir, O. (2004). Super-tasks, accelerating Turing machines and uncomputability. Theoretical Computer Science (317).
Shagrir, O., & Pitowsky I. (2003). Physical hypercomputation and the Church-Turing thesis. Minds and Machines, 13, 87–101.
Shieber, S. (2004). The Turing test: Verbal behavior as the Hallmark of intelligence. Cambridge, MA: MIT Press.MATH
Shor, P. W. (1988). Quantum computing. Documenta Mathematica—Extra Volume—Proceedings of the International Congress of Mathematicians, I, 467–486
Siegelmann, H. T. (2003). Neural and super-Turing computing. Minds and Machines, 13, 103–114.MATHCrossRef
Sipser, M. (1992). The history and status of the P versus NP question. In Proceedings of the twenty-fourth annual ACM symposium on theory of computing (pp. 603–618). Association for Computing Machinery.
Turing, A. (1936). On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, 45, 230–265.
Wolfram, S. (1985). Undecidability and intractability in theoretical physics. Physical Review Letters, 54(8), 735–738.MathSciNetCrossRef
Metadaten
Titel
Philosophy of Mind Is (in Part) Philosophy of Computer Science
verfasst von
Darren Abramson
Publikationsdatum
01.05.2011
Verlag
Springer Netherlands
Erschienen in
Minds and Machines / Ausgabe 2/2011
Print ISSN: 0924-6495
Elektronische ISSN: 1572-8641
DOI
https://doi.org/10.1007/s11023-011-9236-0

Weitere Artikel der Ausgabe 2/2011

Minds and Machines 2/2011 Zur Ausgabe

OriginalPaper

Some Philosophical Issues in Computer Science

OriginalPaper

Do Accelerating Turing Machines Compute the Uncomputable?

OriginalPaper

Sense and Reference on the Web

OriginalPaper

Decoupling as a Fundamental Value of Computer Science

OriginalPaper

Computational Meta-Ethics

OriginalPaper

Program Verification and Functioning of Operative Computing Revisited: How about Mathematics Engineering?

Premium Partner

    Bildnachweise