The easy and hard problems of consciousness: A Cartesian perspective

被引:0
|
作者
Mills, FB [1 ]
机构
[1] Bowie State Univ, Dept Hist & Govt, Bowie, MD 20715 USA
来源
JOURNAL OF MIND AND BEHAVIOR | 1998年 / 19卷 / 02期
关键词
D O I
暂无
中图分类号
B84 [心理学];
学科分类号
04 ; 0402 ;
摘要
This paper contrasts David Chalmers's formulation of the easy and hard problems of consciousness with a Cartesian formulation. For Chalmers, the easy problem is making progress in explaining cognitive functions and discovering how they arise from physical processes in the brain. The hard problem is accounting for why these functions are accompanied by conscious experience. For Descartes, the easy problem is knowing the essential features of conscious experience. The hard problem is verifying our knowledge of the mathematical-physical world. While Chalmers admits that consciousness as subjective experience has something irreducible about it, he also presupposes that conscious experience arises from physical processes. These physical processes are posited as objectively real entities given prior to human experience. The knowledge of such entities is assumed without theoretical justification. This assumption arguably invites a reductive materialist theory of mind. I suggest that employing the Cartesian method to articulate the representational theory of knowledge provides an antidote to reductive materialism and illuminates the conceptual gap between physical processes and conscious experience. To illustrate this I contrast Dennett's heterophenomenology with the Cartesian method of crossing the conceptual gap. I suggest that the hard problem is attaining a knowledge of the extra mental physical objects, not of conscious experience.
引用
收藏
页码:119 / 140
页数:22
相关论文
共 50 条
  • [31] When Students Can Choose Easy, Medium, or Hard Homework Problems
    Teodorescu, Raluca E.
    Seaton, Daniel T.
    Cardamone, Caroline N.
    Rayyan, Saif
    Abbott, Jonathan E.
    Barrantes, Analia
    Pawl, Andrew
    Pritchard, David E.
    [J]. 2011 PHYSICS EDUCATION RESEARCH CONFERENCE, 2012, 1413 : 81 - 84
  • [32] Censoring statistical tables to protect sensitive information: Easy and hard problems
    Malvestuto, FM
    Moscarini, M
    [J]. EIGHTH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE SYSTEMS, PROCEEDINGS, 1996, : 12 - 21
  • [33] No easy answers to hard or easy questions
    Gray, J
    [J]. BEHAVIORAL AND BRAIN SCIENCES, 2001, 24 (01) : 191 - 193
  • [34] On the epistemology and ethics of communicating a Cartesian consciousness
    Dekker, Sidney W. A.
    [J]. SAFETY SCIENCE, 2013, 56 : 96 - 99
  • [36] Easy predictions for the easy-hard-easy transition
    Parkes, AJ
    [J]. EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, 2002, : 688 - 694
  • [37] On 2SAT-MaxOnes with Unbalanced Polarity: from Easy Problems to Hard MaxClique Problems
    Argelich, Josep
    Bejar, Ramon
    Fernandez, Cesar
    Mateu, Carles
    [J]. ARTIFICIAL INTELLIGENCE RESEARCH AND DEVELOPMENT, 2011, 232 : 21 - 30
  • [38] Quantum algorithms for typical hard problems: a perspective of cryptanalysis
    Suo, Jingwen
    Wang, Licheng
    Yang, Sijia
    Zheng, Wenjie
    Zhang, Jiankang
    [J]. QUANTUM INFORMATION PROCESSING, 2020, 19 (06)
  • [39] Learning Hard Optimization Problems: A Data Generation Perspective
    Kotary, James
    Fioretto, Ferdinando
    Van Hentenryck, Pascal
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [40] Quantum algorithms for typical hard problems: a perspective of cryptanalysis
    Jingwen Suo
    Licheng Wang
    Sijia Yang
    Wenjie Zheng
    Jiankang Zhang
    [J]. Quantum Information Processing, 2020, 19