Results 31 to 40 of about 6,830,035 (189)
Some Conceptual and Empirical Shortcomings of IIT
Journal of Anomalous Experience and Cognition, 2022 The Integrated Information Theory of consciousness (IIT) has generated much excitement inside and outside the scientific community, and seems to many the leading contender for a satisfactory theory grounded in systems neuroscience.
Edward F. Kelly
doaj +1 more source
On Evaluating Human Problem Solving of Computationally Hard Problems [PDF]
, 2013 This article is concerned with how computer science, and more exactly computational complexity theory, can inform cognitive science. In particular, we suggest factors to be taken into account when investigating how people deal with computational hardness.
Stege, Ulrike, Carruthers, Sarah
core +1 more source
The Sorting Buffer Problem is NP-hard
, 2010 We consider the offline sorting buffer problem. The input is a sequence of items of different types. All items must be processed one by one by a server. The server is equipped with a random-access buffer of limited capacity which can be used to rearrange
Rene Sitters (7669562) +3 more
core +4 more sources
Hardness of Approximation for Knapsack Problems [PDF]
Theory of Computing Systems, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
H.M. Buhrman (Harry) +2 more
openaire +5 more sources
An 8/5 approximation algorithm for a hard variant of stable marriage [PDF]
, 2007 When ties and incomplete preference lists are permitted in the Stable Marriage problem, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is NP-hard, even under very severe ...
Irving, R.W. +3 more
core +1 more source
Ten Testable Properties of Consciousness
Frontiers in Psychology, 2020 This article develops a view of consciousness in the context of a new philosophical approach that invokes the concept of emergence, through which the operative principles of each level of organization of physical energy flow are functionally dissociated ...
Christopher W. Tyler
doaj +1 more source
Hardness of Approximation for Quantum Problems [PDF]
Quantum Information and Computation, 2012 The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the second level of this quantum hierarchy, but that these problems are in fact hard to approximate.
Sevag Gharibian, Julia Kempe
openaire +4 more sources
The Steiner tree problem on graphs: inapproximability results [PDF]
, 2008 The Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a given subset of the vertices (terminals). We show that it is NP-hard to approximate the Steiner tree problem within a factor 96/95.
Chlebikova, Janka +3 more
core +1 more source
Do People Think Consciousness Poses a Hard Problem?: Empirical Evidence on the Meta-Problem of Consciousness [PDF]
, 2021 In a recent paper in this journal, David Chalmers introduced the meta-problem of consciousness as “the problem of explaining why we think consciousness poses a hard problem” (Chalmers, 2018, p. 6).
Díaz, Rodrigo, Díaz, R.
core
Process Metaphysics of Consciousness
Open Philosophy, 2018 In this article, we look at the hard problem of consciousness from the perspective of process metaphysics. We thereby identify three problematic premises of the problem that pertain to the constitution of consciousness and its causal relation to the ...
Prentner Robert
doaj +1 more source