Results 51 to 60 of about 6,830,035 (189)
, 2017 Chalmer's famously identified pinpointing an explanation for our subjective experience as the "hard problem of consciousness". He argued that subjective experience constitutes a "hard problem" in the sense that its explanation will ultimately require new physical laws or principles. Here, we propose a corresponding "hard problem of life" as the problem
Walker, Sara Imari, Davies, Paul C. W.
openaire +2 more sources
Consciousness in robots: the hard problem and some less hard problems [PDF]
ROMAN 2005. IEEE International Workshop on Robot and Human Interactive Communication, 2005., 2006 Based on results from evolutionary psychology we discuss important functions that can be served by consciousness in autonomous robots. We distinguish intrinsic intentionality from consciousness, but argue it is also important. Finally we explore the hard problem for robots (i.e., whether they can experience subjective awareness) from the perspective of
openaire +1 more source
Obliczeniowe teorie świadomości (Computational theories of consciousness) [PDF]
Analiza i Egzystencja, 2010 In this paper, I review the motivations for having a computational theory of consciousness to see if they turn out to be no longer plausible in the light of recent criticisms.
Marcin Miłkowski
doaj
Frontiers in PsychologyExplaining subjective experience (the “hard problem”) remains a central challenge in consciousness science. Research on “quantum consciousness” has grown rapidly in recent years, yet a substantial subset merely links terms such as collapse, superposition,
Xun Ma, Aoping Wang
doaj +1 more source
Animal Sentience, 2016 The hard problem of consciousness is to explain why certain physical states are conscious: why do they feel the way they do, rather than some other way or no way at all? Arthur Reber (2016) claims to solve the hard problem.
Derek Ball
doaj +1 more source
Nature-inspired optimization algorithms in knapsack problem: A review [PDF]
المجلة العراقية للعلوم الاحصائية, 2019 Meta-heuristic algorithms have become an arising field of research in recent years. Some of these algorithms have proved to be efficient in solving combinatorial optimization problems, particularly knapsack problem.
Ghalya Tawfeeq Basheer, Zakariya Algamal
doaj +1 more source
Safe Approximation—An Efficient Solution for a Hard Routing Problem
Algorithms, 2021 The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but various
András Faragó, Zohre R. Mojaveri
doaj +1 more source
Reoptimization of NP-Hard Problems [PDF]
, 2018 A reoptimization problem, given two similar instances of an optimization problem and a good solution to the first instance, asks for a solution to the second. In this paper we propose general approximation algorithms applicable to a wide class of reoptimization problems.
openaire +2 more sources
The Complexity and Distribution of Hard Problems
SIAM Journal on Computing, 1995 Summary: Measure-theoretic aspects of the \(\leq^{\text{P}}_m\)-reducibility structure of the exponential time complexity classes \(\text{E} = \text{DTIME}(2^{\text{linear}})\) and \(\text{E}_2 = \text{DTIME}(2^{\text{polynomial}})\) are investigated.
David W. Juedes, Jack H. Lutz
openaire +5 more sources
Mind/body “hard problem” is not a category error
Animal Sentience, 2016 Reber’s Cellular Basis of Consciousness (CBC) has much to recommend it. However, while the CBC effectively renders null any ontological gap between mind and body, it leaves two important remaining gaps unaddressed: the epistemologic and the causal gap ...
Linda A.W. Brakel
doaj +1 more source