scholarly journals Panpsychism’s Combination Problem Is a Problem for Everyone

2019 ◽  
pp. 303-316
Author(s):  
Angela Mendelovici
Keyword(s):  
Author(s):  
Philip Goff

This is the first of two chapters discussing the most notorious problem facing Russellian monism: the combination problem. This is actually a family of difficulties, each reflecting the challenge of how to make sense of everyday human and animal experience intelligibly arising from more fundamental conscious or protoconscious features of reality. Key challenges facing panpsychist and panpsychist forms of Russellian monism are considered. With respect to panprotopsychism, there is the worry that it collapses into noumenalism: the view that human beings, by their very nature, are unable to understand the concrete, categorical nature of matter. With respect to panpsychism, there is the subject-summing problem: the difficulty making sense of how micro-level conscious subjects combine to produce macro-level conscious subjects. A solution to the subject-summing problem is proposed, and it is ultimately argued that panpsychist forms of the Russellian monism are to be preferred on grounds of simplicity and elegance.


2021 ◽  
Vol 91 ◽  
pp. 102094
Author(s):  
Mahesh D. Pandey ◽  
J.A.M. van der Weide ◽  
N. Manzana

Author(s):  
SERGEY TULYAKOV ◽  
CHAOHONG WU ◽  
VENU GOVINDARAJU

We have investigated different scenarios of combining pattern matchers. The combination problem can be viewed as a construction of a postprocessing classifier operating on the matching scores of the combined matchers. The optimal combination algorithm for verification systems corresponds to the likelihood ratio combination function. It can be implemented by the direct reconstruction of this function with genuine and impostor score density approximations. However, the optimal combination algorithm for identification systems is difficult to express analytically. We will show that this difficulty is caused by the dependencies between matching scores assigned to different classes by the same classifier. The experiments on the large sets of scores from handwritten word recognizers operating on postal images and biometric matchers (NIST biometric score set BSSR1) confirm the existence of such dependencies and that the optimal combination functions for verification and identification systems are different.


Erkenntnis ◽  
2016 ◽  
Vol 82 (1) ◽  
pp. 103-120 ◽  
Author(s):  
Kevin Morris
Keyword(s):  

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Jianhui Lv ◽  
Xingwei Wang ◽  
Min Huang

Since the research on information consistency of the whole network under OSPF protocol has been insufficient in recent years, an algorithm based on limitation arrangement principle for routing decision is proposed and it is a permutation and combination problem in mathematical area. The most fundamental function of this algorithm is to accomplish the information consistency of the whole network at a relatively fast speed. Firstly, limitation arrangement principle algorithm is proposed and proved. Secondly, LAP routing algorithm in single link network and LAP routing algorithm in single link network with multiloops are designed. Finally, simulation experiments are worked by VC6.0 and NS2, which proves that LAPSN algorithm and LAPSNM algorithm can solve the problem of information consistency of the whole network under OSPF protocol and LAPSNM algorithm is superior to Dijkstra algorithm.


Author(s):  
Serdar Erbatur ◽  
Deepak Kapur ◽  
Andrew M. Marshall ◽  
Catherine Meadows ◽  
Paliath Narendran ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document