Self Reducibility
   HOME





Self Reducibility
In philosophy, the self is an individual's own being, knowledge, and values, and the relationship between these attributes. The first-person perspective distinguishes selfhood from personal identity. Whereas "identity" is (literally) sameness and may involve categorization and labeling, selfhood implies a first-person perspective and suggests potential uniqueness. Conversely, "person" is used as a third-person reference. Personal identity can be impaired in late-stage Alzheimer's disease and in other neurodegenerative diseases. Finally, the self is distinguishable from "others". Including the distinction between sameness and otherness, the self versus other is a research topic in contemporary philosophy and contemporary phenomenology (see also psychological phenomenology), psychology, psychiatry, neurology, and neuroscience. Although subjective experience is central to selfhood, the privacy of this experience is only one of many problems in the philosophy of self and scie ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   [Amazon]


picture info

Computational Complexity Theory
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and explores the relationships between these classifications. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying their computational complexity, i.e., the amount of resources needed to solve them, such as time and storage. Other measures of complexity are also used, such as the amount of communication (used in communication complexity), the number of logic gate, gates in a circuit (used in circuit complexity) and the number of processors (used in parallel computing). O ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   [Amazon]



MORE