Random Articles (Page 6)

Have a deep view into what people are curious about.

πŸ”— Neutral Monism

πŸ”— Philosophy πŸ”— Philosophy/Philosophy of religion πŸ”— Philosophy/Philosophy of mind πŸ”— Philosophy/Metaphysics

Neutral monism is an umbrella term for a class of metaphysical theories in the philosophy of mind, concerning the relation of mind to matter. These theories take the fundamental nature of reality to be neither mental nor physical; in other words it is "neutral".

Neutral monism has gained prominence as a potential solution to theoretical issues within the philosophy of mind, specifically the mind–body problem and the hard problem of consciousness. The mind–body problem is the problem of explaining how mind relates to matter. The hard problem is a related philosophical problem targeted at physicalist theories of mind specifically: the problem arises because it is not obvious how a purely physical universe could give rise to conscious experience. This is because physical explanations are mechanistic: that is, they explain phenomena by appealing to underlying functions and structures. And, though explanations of this sort seem to work well for a wide variety of phenomena, conscious experience seems uniquely resistant to functional explanations. As the philosopher David Chalmers has put it: "even when we have explained the performance of all the cognitive and behavioral functions in the vicinity of experience - perceptual discrimination, categorization, internal access, verbal report - there may still remain a further unanswered question: Why is the performance of these functions accompanied by experience?" The hard problem has motivated Chalmers and other philosophers to abandon the project of explaining consciousness in terms physical or chemical mechanisms (only 56.5% of philosophers are physicalists, according to the most recent PhilPapers survey).

With this, there has been growing demand for alternative ontologies (such as neutral monism) that may provide explanatory frameworks more suitable for explaining the existence of consciousness. It has been accepted by several prominent English-speaking philosophers, such as William James and Bertrand Russell.

Discussed on

πŸ”— Hybridogenesis in water frogs

πŸ”— Genetics πŸ”— Amphibians and Reptiles

The fertile hybrids of European water frogs (genus Pelophylax) reproduce by hybridogenesis (hemiclonally). This means that during gametogenesis, they discard the genome of one of the parental species and produce gametes of the other parental species (containing a genome not recombined with the genome of the first parental species). The first parental genome is restored by fertilization of these gametes with gametes from the first species (sexual host). In all-hybrid populations of the edible frog Pelophylax kl. esculentus, however, triploid hybrids provide this missing genome.

Because half of the genome is transmitted to the next generation clonally (not excluded unrecombined intact genome), and only the other half sexually (recombined genome of the sexual host), the hybridogenesis is a hemiclonal mode of reproduction.

For example, the edible frog Pelophylax kl. esculentus (mostly RL genome), which is a hybridogenetic hybrid of the marsh frog P. ridibundus (RR) and the pool frog P. lessonae (LL), usually excludes the lessonae genome (L) and generates gametes of the P. ridibundus (R). In other words, edible frogs produce gametes of marsh frogs.

The hybrid populations are propagated, however, not by the above primary hybridisations, but predominantly by backcrosses with one of the parental species they coexist (live in sympatry) with (see below in the middle).

Since the hybridogenetic hybrids require another taxon as sexual host to reproduce, usually one of the parental species, they are called kleptons (with "kl." in scientific names).

There are three known hybridogenetic hybrids of the European water frogs:

  • edible frog Pelophylax kl. esculentus (usually genotype RL):
    pool frog P. lessonae (LL) Γ— P. ridibundus (RR)
  • Graf's hybrid frog Pelophylax kl. grafi (PR):
    Perez's frog P. perezi (PP) Γ— P. ridibundus (RR) or
    Perez's frog P. perezi (PP) Γ— edible frog P. kl. esculentus (RE)
    (it is unclear which one crossing was the primary hybridisation)
  • Italian edible frog Pelophylax kl. hispanicus (RB):
    Italian pool frog P. bergeri (BB) Γ— P. ridibundus (RR)

Discussed on

πŸ”— Sexagesimal

πŸ”— Mathematics

Sexagesimal (also known as base 60 or sexagenary) is a numeral system with sixty as its base. It originated with the ancient Sumerians in the 3rd millennium BC, was passed down to the ancient Babylonians, and is still usedβ€”in a modified formβ€”for measuring time, angles, and geographic coordinates.

The number 60, a superior highly composite number, has twelve factors, namely 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, and 60, of which 2, 3, and 5 are prime numbers. With so many factors, many fractions involving sexagesimal numbers are simplified. For example, one hour can be divided evenly into sections of 30 minutes, 20 minutes, 15 minutes, 12 minutes, 10 minutes, 6 minutes, 5 minutes, 4 minutes, 3 minutes, 2 minutes, and 1 minute. 60 is the smallest number that is divisible by every number from 1 to 6; that is, it is the lowest common multiple of 1, 2, 3, 4, 5, and 6.

In this article, all sexagesimal digits are represented as decimal numbers, except where otherwise noted. For example, 10 means the number ten and 60 means the number sixty.

Discussed on

πŸ”— Gravitation water vortex power plant

πŸ”— Energy

The gravitation water vortex power plant is a type of micro hydro vortex turbine system which is capable of converting energy in a moving fluid to rotational energy using a low hydraulic head of 0.7–3 metres (2Β ft 4Β in–9Β ft 10Β in). The technology is based on a round basin with a central drain. Above the drain the water forms a stable line vortex which drives a water turbine.

It was first patented by Greek-Australian Lawyer & Inventor Paul Kouris in 1996, who was searching for a way to harness the power inherent in a vortex.

Later, Austrian Inventor Franz ZotlΓΆterer created a similar turbine while attempting to find a way to aerate water without an external power source.

Discussed on

πŸ”— SWEET16: Interpreted byte-code instruction set invented by Steve Wozniak

πŸ”— Apple Inc.

SWEET16 is an interpreted byte-code instruction set invented by Steve Wozniak and implemented as part of the Integer BASIC ROM in the Apple II series of computers. It was created because Wozniak needed to manipulate 16-bit pointer data, and the Apple II was an 8-bit computer.

SWEET16 was not used by the core BASIC code, but was later used to implement several utilities. Notable among these was the line renumbering routine, which was included in the Programmer's Aid #1 ROM, added to later Apple II models and available for user installation on earlier examples.

SWEET16 code is executed as if it were running on a 16-bit processor with sixteen internal 16-bit little-endian registers, named R0 through R15. Some registers have well-defined functions:

  • R0 – accumulator
  • R12 – subroutine stack pointer
  • R13 – stores the result of all comparison operations for branch testing
  • R14 – status register
  • R15 – program counter

The 16 virtual registers, 32 bytes in total, are located in the zero page of the Apple II's real, physical memory map (at $00–$1F), with values stored as low byte followed by high byte. The SWEET16 interpreter itself is located from $F689 to $F7FC in the Integer BASIC ROM.

According to Wozniak, the SWEET16 implementation is a model of frugal coding, taking up only about 300 bytes in memory. SWEET16 runs at about one-tenth the speed of the equivalent native 6502 code.

πŸ”— Billion laughs attack

πŸ”— Computer Security πŸ”— Computer Security/Computing

In computer security, a billion laughs attack is a type of denial-of-service (DoS) attack which is aimed at parsers of XML documents.

It is also referred to as an XML bomb or as an exponential entity expansion attack.

Discussed on

πŸ”— Effects of Stress on Memory

πŸ”— Psychology πŸ”— Neuroscience πŸ”— Physiology

The effects of stress on memory include interference with a person's capacity to encode memory and the ability to retrieve information. Stimuli, like stress, improved memory when it was related to learning the subject. During times of stress, the body reacts by secreting stress hormones into the bloodstream. Stress can cause acute and chronic changes in certain brain areas which can cause long-term damage. Over-secretion of stress hormones most frequently impairs long-term delayed recall memory, but can enhance short-term, immediate recall memory. This enhancement is particularly relative in emotional memory. In particular, the hippocampus, prefrontal cortex and the amygdala are affected. One class of stress hormone responsible for negatively affecting long-term, delayed recall memory is the glucocorticoids (GCs), the most notable of which is cortisol. Glucocorticoids facilitate and impair the actions of stress in the brain memory process. Cortisol is a known biomarker for stress. Under normal circumstances, the hippocampus regulates the production of cortisol through negative feedback because it has many receptors that are sensitive to these stress hormones. However, an excess of cortisol can impair the ability of the hippocampus to both encode and recall memories. These stress hormones are also hindering the hippocampus from receiving enough energy by diverting glucose levels to surrounding muscles.

Stress affects many memory functions and cognitive functioning of the brain. There are different levels of stress and the high levels can be intrinsic or extrinsic. Intrinsic stress level is triggered by a cognitive challenge whereas extrinsic can be triggered by a condition not related to a cognitive task. Intrinsic stress can be acutely and chronically experienced by a person. The varying effects of stress on performance or stress hormones are often compared to or known as "inverted-u" which induce areas in learning, memory and plasticity. Chronic stress can affect the brain structure and cognition.

Studies considered the effects of both intrinsic and extrinsic stress on memory functions, using for both of them Pavlovian conditioning and spatial learning. In regard to intrinsic memory functions, the study evaluated how stress affected memory functions that was triggered by a learning challenge. In regard to extrinsic stress, the study focused on stress that was not related to cognitive task but was elicited by other situations. The results determined that intrinsic stress was facilitated by memory consolidation process and extrinsic stress was determined to be heterogeneous in regard to memory consolidation. Researchers found that high stress conditions were a good representative of the effect that extrinsic stress can cause on memory functioning. It was also proven that extrinsic stress does affect spatial learning whereas acute extrinsic stress does not.

Discussed on

πŸ”— Angel Problem

The angel problem is a question in combinatorial game theory proposed by John Horton Conway. The game is commonly referred to as the Angels and Devils game. The game is played by two players called the angel and the devil. It is played on an infinite chessboard (or equivalently the points of a 2D lattice). The angel has a power k (a natural number 1 or higher), specified before the game starts. The board starts empty with the angel at the origin. On each turn, the angel jumps to a different empty square which could be reached by at most k moves of a chess king, i.e. the distance from the starting square is at most k in the infinity norm. The devil, on its turn, may add a block on any single square not containing the angel. The angel may leap over blocked squares, but cannot land on them. The devil wins if the angel is unable to move. The angel wins by surviving indefinitely.

The angel problem is: can an angel with high enough power win?

There must exist a winning strategy for one of the players. If the devil can force a win then it can do so in a finite number of moves. If the devil cannot force a win then there is always an action that the angel can take to avoid losing and a winning strategy for it is always to pick such a move. More abstractly, the "pay-off set" (i.e., the set of all plays in which the angel wins) is a closed set (in the natural topology on the set of all plays), and it is known that such games are determined. Of course, for any infinite game, if player 2 doesn't have a winning strategy, player 1 can always pick a move that leads to a position where player 2 doesn't have a winning strategy, but in some games, simply playing forever doesn't confer a win to player 1, and that's why undetermined games may exist.

Conway offered a reward for a general solution to this problem ($100 for a winning strategy for an angel of sufficiently high power, and $1000 for a proof that the devil can win irrespective of the angel's power). Progress was made first in higher dimensions. In late 2006, the original problem was solved when independent proofs appeared, showing that an angel can win. Bowditch proved that a 4-angel (that is, an angel with power k=4) can win and MΓ‘thΓ© and Kloster gave proofs that a 2-angel can win. At this stage, it has not been confirmed by Conway who is to be the recipient of his prize offer, or whether each published and subsequent solution will also earn $100 US.

Discussed on